TSTP Solution File: SYO078^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO078^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 : n004.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:02:52 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 4 unt; 1 typ; 0 def)
% Number of atoms : 158 ( 36 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 83 ( 33 ~; 33 |; 2 &)
% ( 15 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 72 ( 70 fml; 2 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 13 ( 10 usr; 11 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 2 ( 1 !; 0 ?; 2 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_3,type,
vEPSILON:
!>[X0: $tType] : sTfun(sTfun(X0,$o),X0) ).
tff(f76,plain,
$false,
inference(avatar_sat_refutation,[],[f42,f45,f46,f57,f61,f66,f70,f72]) ).
tff(f72,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f71,f27,f18]) ).
tff(f18,plain,
( spl0_2
<=> ( cP = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
tff(f27,plain,
( spl0_4
<=> ( cQ = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
tff(f71,plain,
( ( cP != $false )
| ~ spl0_4 ),
inference(forward_demodulation,[],[f8,f29]) ).
tff(f29,plain,
( ( cQ = $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f8,plain,
cP != cQ,
inference(cnf_transformation,[],[f7]) ).
tff(f7,plain,
( ( cP != cR )
& ( cQ != cR )
& ( cP != cQ ) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,plain,
~ ( ( cP = cR )
| ( cP = cQ )
| ( cQ = cR ) ),
inference(fool_elimination,[],[f5]) ).
tff(f5,plain,
~ ( ( cQ
<=> cP )
| ( cP
<=> cR )
| ( cQ
<=> cR ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( cQ
<=> cP )
| ( cP
<=> cR )
| ( cQ
<=> cR ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( cQ
<=> cP )
| ( cP
<=> cR )
| ( cQ
<=> cR ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM49) ).
tff(f70,plain,
( spl0_6
| spl0_5 ),
inference(avatar_split_clause,[],[f69,f34,f39]) ).
tff(f39,plain,
( spl0_6
<=> ( cR = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
tff(f34,plain,
( spl0_5
<=> ( cR = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
tff(f69,plain,
( ( cR = $true )
| spl0_5 ),
inference(trivial_inequality_removal,[],[f67]) ).
tff(f67,plain,
( ( $false != $false )
| ( cR = $true )
| spl0_5 ),
inference(superposition,[],[f36,f4]) ).
tff(f4,plain,
! [X0: $o] :
( ( $true = (X0) )
| ( $false = (X0) ) ),
introduced(fool_axiom,[]) ).
tff(f36,plain,
( ( cR != $false )
| spl0_5 ),
inference(avatar_component_clause,[],[f34]) ).
tff(f66,plain,
( ~ spl0_5
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f63,f27,f34]) ).
tff(f63,plain,
( ( cR != $false )
| ~ spl0_4 ),
inference(backward_demodulation,[],[f9,f29]) ).
tff(f9,plain,
cQ != cR,
inference(cnf_transformation,[],[f7]) ).
tff(f61,plain,
( spl0_4
| spl0_1 ),
inference(avatar_split_clause,[],[f60,f14,f27]) ).
tff(f14,plain,
( spl0_1
<=> ( cQ = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
tff(f60,plain,
( ( cQ = $false )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f59]) ).
tff(f59,plain,
( ( $true != $true )
| ( cQ = $false )
| spl0_1 ),
inference(superposition,[],[f15,f4]) ).
tff(f15,plain,
( ( cQ != $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f14]) ).
tff(f57,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f52,f23,f14]) ).
tff(f23,plain,
( spl0_3
<=> ( cP = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
tff(f52,plain,
( ( cQ != $true )
| ~ spl0_3 ),
inference(backward_demodulation,[],[f8,f24]) ).
tff(f24,plain,
( ( cP = $true )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f23]) ).
tff(f46,plain,
( ~ spl0_6
| spl0_2 ),
inference(avatar_split_clause,[],[f44,f18,f39]) ).
tff(f44,plain,
( ( cP = $false )
| ( cR != $true ) ),
inference(superposition,[],[f10,f4]) ).
tff(f10,plain,
cP != cR,
inference(cnf_transformation,[],[f7]) ).
tff(f45,plain,
( spl0_3
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f43,f34,f23]) ).
tff(f43,plain,
( ( cR != $false )
| ( cP = $true ) ),
inference(superposition,[],[f10,f4]) ).
tff(f42,plain,
( ~ spl0_6
| spl0_4 ),
inference(avatar_split_clause,[],[f32,f27,f39]) ).
tff(f32,plain,
( ( cQ = $false )
| ( cR != $true ) ),
inference(superposition,[],[f9,f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SYO078^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.13 % 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.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 10:51:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TH0_THM_NEQ_NAR problem
% 0.12/0.34 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.12/0.35 % (10542)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.12/0.35 % (10541)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.12/0.35 % (10543)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.12/0.35 % (10545)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.35 % (10546)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.12/0.35 % (10542)Instruction limit reached!
% 0.12/0.35 % (10542)------------------------------
% 0.12/0.35 % (10542)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (10542)Termination reason: Unknown
% 0.12/0.35 % (10542)Termination phase: Saturation
% 0.12/0.35 % (10543)Instruction limit reached!
% 0.12/0.35 % (10543)------------------------------
% 0.12/0.35 % (10543)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (10543)Termination reason: Unknown
% 0.12/0.35 % (10543)Termination phase: Saturation
% 0.12/0.35
% 0.12/0.35 % (10543)Memory used [KB]: 5500
% 0.12/0.35 % (10543)Time elapsed: 0.003 s
% 0.12/0.35 % (10543)Instructions burned: 2 (million)
% 0.12/0.35 % (10543)------------------------------
% 0.12/0.35 % (10543)------------------------------
% 0.12/0.35
% 0.12/0.35 % (10542)Memory used [KB]: 5500
% 0.12/0.35 % (10542)Time elapsed: 0.003 s
% 0.12/0.35 % (10542)Instructions burned: 2 (million)
% 0.12/0.35 % (10542)------------------------------
% 0.12/0.35 % (10542)------------------------------
% 0.12/0.35 % (10541)First to succeed.
% 0.12/0.35 % (10544)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.12/0.35 % (10546)Also succeeded, but the first one will report.
% 0.12/0.35 % (10544)Refutation not found, incomplete strategy
% 0.12/0.35 % (10544)------------------------------
% 0.12/0.35 % (10544)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (10544)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 % (10544)Memory used [KB]: 5373
% 0.12/0.35 % (10544)Time elapsed: 0.003 s
% 0.12/0.35 % (10544)Instructions burned: 1 (million)
% 0.12/0.35 % (10544)------------------------------
% 0.12/0.35 % (10544)------------------------------
% 0.12/0.35 % (10545)Also succeeded, but the first one will report.
% 0.12/0.36 % (10541)Refutation found. Thanks to Tanya!
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36 % (10541)------------------------------
% 0.12/0.36 % (10541)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (10541)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (10541)Memory used [KB]: 5500
% 0.12/0.36 % (10541)Time elapsed: 0.004 s
% 0.12/0.36 % (10541)Instructions burned: 1 (million)
% 0.12/0.36 % (10541)------------------------------
% 0.12/0.36 % (10541)------------------------------
% 0.12/0.36 % (10538)Success in time 0.015 s
% 0.12/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------