TSTP Solution File: SYO299^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO299^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 : n022.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:52 EDT 2024
% Result : Theorem 0.07s 0.29s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 124 ( 64 equ)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 97 ( 31 ~; 26 |; 19 &)
% ( 15 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 146 ( 59 fml; 87 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 5 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 43 ( 24 !; 19 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
tff(f34,plain,
$false,
inference(subsumption_resolution,[],[f32,f31]) ).
tff(f31,plain,
! [X0: $o,X1: $o] : ( (X0) = (X1) ),
inference(superposition,[],[f28,f28]) ).
tff(f28,plain,
! [X3: $o] : ( sK0 = (X3) ),
inference(subsumption_resolution,[],[f13,f17]) ).
tff(f17,plain,
$true != sK1,
inference(equality_resolution,[],[f14]) ).
tff(f14,plain,
! [X3: $o] :
( ( sK0 != (X3) )
| ( $true != sK1 ) ),
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
! [X3: $o] :
( ( ( $true = sK2 )
| ( sK0 != sK1 ) )
& ( ( sK0 = sK1 )
| ( $true != sK2 ) )
& ( ( sK0 != (X3) )
| ( $true != sK1 ) )
& ( ( sK0 = (X3) )
| ( $true = sK1 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11]) ).
tff(f11,plain,
( ? [X0: $o,X1: $o,X2: $o] :
! [X3: $o] :
( ( ( $true = (X2) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( $true != (X2) ) )
& ( ( (X0) != (X3) )
| ( $true != (X1) ) )
& ( ( (X0) = (X3) )
| ( $true = (X1) ) ) )
=> ! [X3: $o] :
( ( ( $true = sK2 )
| ( sK0 != sK1 ) )
& ( ( sK0 = sK1 )
| ( $true != sK2 ) )
& ( ( sK0 != (X3) )
| ( $true != sK1 ) )
& ( ( sK0 = (X3) )
| ( $true = sK1 ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f10,plain,
? [X0: $o,X1: $o,X2: $o] :
! [X3: $o] :
( ( ( $true = (X2) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( $true != (X2) ) )
& ( ( (X0) != (X3) )
| ( $true != (X1) ) )
& ( ( (X0) = (X3) )
| ( $true = (X1) ) ) ),
inference(rectify,[],[f9]) ).
tff(f9,plain,
? [X1: $o,X2: $o,X0: $o] :
! [X3: $o] :
( ( ( $true = (X0) )
| ( (X1) != (X2) ) )
& ( ( (X1) = (X2) )
| ( $true != (X0) ) )
& ( ( (X1) != (X3) )
| ( $true != (X2) ) )
& ( ( (X1) = (X3) )
| ( $true = (X2) ) ) ),
inference(flattening,[],[f8]) ).
tff(f8,plain,
? [X1: $o,X2: $o,X0: $o] :
! [X3: $o] :
( ( ( $true = (X0) )
| ( (X1) != (X2) ) )
& ( ( (X1) = (X2) )
| ( $true != (X0) ) )
& ( ( (X1) != (X3) )
| ( $true != (X2) ) )
& ( ( (X1) = (X3) )
| ( $true = (X2) ) ) ),
inference(nnf_transformation,[],[f7]) ).
tff(f7,plain,
? [X1: $o,X2: $o,X0: $o] :
! [X3: $o] :
( ( ( $true = (X0) )
<=> ( (X1) = (X2) ) )
& ( ( $true = (X2) )
<~> ( (X1) = (X3) ) ) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,plain,
~ ! [X2: $o,X1: $o,X0: $o] :
? [X3: $o] :
( ( ( $true = (X0) )
<=> ( (X1) = (X2) ) )
=> ( ( $true = (X2) )
<=> ( (X1) = (X3) ) ) ),
inference(fool_elimination,[],[f5]) ).
tff(f5,plain,
~ ! [X0: $o,X1: $o,X2: $o] :
? [X3: $o] :
( ( ( (X2)
<=> (X1) )
<=> (X0) )
=> ( (X2)
<=> ( (X3)
<=> (X1) ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X2: $o,X1: $o,X0: $o] :
? [X3: $o] :
( ( ( (X0)
<=> (X1) )
<=> (X2) )
=> ( (X0)
<=> ( (X3)
<=> (X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X2: $o,X1: $o,X0: $o] :
? [X3: $o] :
( ( ( (X0)
<=> (X1) )
<=> (X2) )
=> ( (X0)
<=> ( (X3)
<=> (X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM51) ).
tff(f13,plain,
! [X3: $o] :
( ( $true = sK1 )
| ( sK0 = (X3) ) ),
inference(cnf_transformation,[],[f12]) ).
tff(f32,plain,
$true != sK0,
inference(superposition,[],[f17,f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : SYO299^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.08 % 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.07/0.27 % Computer : n022.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Mon May 20 08:48:37 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.07/0.27 This is a TH0_THM_NEQ_NAR problem
% 0.07/0.27 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.07/0.28 % (18396)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.07/0.28 % (18395)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.07/0.28 % (18400)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.07/0.28 % (18398)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.07/0.28 % (18399)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.07/0.28 % (18397)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.07/0.28 % (18402)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.07/0.28 % (18401)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.07/0.29 % (18399)Instruction limit reached!
% 0.07/0.29 % (18399)------------------------------
% 0.07/0.29 % (18399)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.29 % (18399)Termination reason: Unknown
% 0.07/0.29 % (18399)Termination phase: Saturation
% 0.07/0.29
% 0.07/0.29 % (18399)Memory used [KB]: 5500
% 0.07/0.29 % (18399)Time elapsed: 0.002 s
% 0.07/0.29 % (18399)Instructions burned: 2 (million)
% 0.07/0.29 % (18399)------------------------------
% 0.07/0.29 % (18399)------------------------------
% 0.07/0.29 % (18400)First to succeed.
% 0.07/0.29 % (18396)Also succeeded, but the first one will report.
% 0.07/0.29 % (18400)Refutation found. Thanks to Tanya!
% 0.07/0.29 % SZS status Theorem for theBenchmark
% 0.07/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.29 % (18400)------------------------------
% 0.07/0.29 % (18400)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.29 % (18400)Termination reason: Refutation
% 0.07/0.29
% 0.07/0.29 % (18400)Memory used [KB]: 5500
% 0.07/0.29 % (18400)Time elapsed: 0.002 s
% 0.07/0.29 % (18400)Instructions burned: 1 (million)
% 0.07/0.29 % (18400)------------------------------
% 0.07/0.29 % (18400)------------------------------
% 0.07/0.29 % (18394)Success in time 0.01 s
% 0.07/0.29 % Vampire---4.8 exiting
%------------------------------------------------------------------------------