TSTP Solution File: SYO198^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO198^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 09:03:27 EDT 2024
% Result : Theorem 0.16s 0.38s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 3 unt; 1 typ; 0 def)
% Number of atoms : 42 ( 16 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 49 ( 17 ~; 6 |; 4 &; 21 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 1 ^ 14 !; 10 ?; 26 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_7,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f17,plain,
$false,
inference(trivial_inequality_removal,[],[f16]) ).
thf(f16,plain,
$true != $true,
inference(beta_eta_normalization,[],[f15]) ).
thf(f15,plain,
( ( ^ [Y0: $o] : $true
@ sK1 )
!= $true ),
inference(equality_resolution,[],[f10]) ).
thf(f10,plain,
! [X2: $o > $o] :
( ( $true
!= ( X2 @ sK0 ) )
| ( ( X2 @ sK1 )
!= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
! [X2: $o > $o] :
( ( $true
!= ( X2 @ sK0 ) )
| ( ( X2 @ sK1 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( ( X2 @ X0 )
!= $true )
| ( ( X2 @ X1 )
!= $true ) )
=> ! [X2: $o > $o] :
( ( $true
!= ( X2 @ sK0 ) )
| ( ( X2 @ sK1 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( ( X2 @ X0 )
!= $true )
| ( ( X2 @ X1 )
!= $true ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
? [X1: $o,X0: $o] :
! [X2: $o > $o] :
( ( ( X2 @ X1 )
!= $true )
| ( ( X2 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: $o,X1: $o] :
? [X2: $o > $o] :
( ( ( X2 @ X1 )
= $true )
& ( ( X2 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: $o,X1: $o] :
? [X2: $o > $o] :
( ( X2 @ X0 )
& ( X2 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: $o,X0: $o] :
? [X2: $o > $o] :
( ( X2 @ X1 )
& ( X2 @ X0 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: $o,X0: $o] :
? [X2: $o > $o] :
( ( X2 @ X1 )
& ( X2 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCT8) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SYO198^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 08:47:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.38 % (18306)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.16/0.38 % (18306)First to succeed.
% 0.16/0.38 % (18306)Refutation found. Thanks to Tanya!
% 0.16/0.38 % SZS status Theorem for theBenchmark
% 0.16/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.38 % (18306)------------------------------
% 0.16/0.38 % (18306)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (18306)Termination reason: Refutation
% 0.16/0.38
% 0.16/0.38 % (18306)Memory used [KB]: 5500
% 0.16/0.38 % (18306)Time elapsed: 0.002 s
% 0.16/0.38 % (18306)Instructions burned: 1 (million)
% 0.16/0.38 % (18306)------------------------------
% 0.16/0.38 % (18306)------------------------------
% 0.16/0.38 % (18298)Success in time 0.002 s
% 0.16/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------