TSTP Solution File: SYO079^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO079^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 : n025.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.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 59 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 324 ( 71 equ)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 193 ( 70 ~; 91 |; 7 &)
% ( 20 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 142 ( 142 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 8 usr; 10 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(f72,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f30,f31,f32,f40,f51,f56,f62,f67,f71]) ).
tff(f71,plain,
( ~ spl0_2
| ~ spl0_4
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f70]) ).
tff(f70,plain,
( $false
| ~ spl0_2
| ~ spl0_4
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f69]) ).
tff(f69,plain,
( ( $false = $true )
| ~ spl0_2
| ~ spl0_4
| ~ spl0_5 ),
inference(backward_demodulation,[],[f28,f68]) ).
tff(f68,plain,
( ( cR = $false )
| ~ spl0_2
| ~ spl0_5 ),
inference(backward_demodulation,[],[f19,f55]) ).
tff(f55,plain,
( ( cQ = $false )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f53]) ).
tff(f53,plain,
( spl0_5
<=> ( cQ = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
tff(f19,plain,
( ( cQ = cR )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f18]) ).
tff(f18,plain,
( spl0_2
<=> ( cQ = cR ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
tff(f28,plain,
( ( cR = $true )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f27,plain,
( spl0_4
<=> ( cR = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
tff(f67,plain,
( spl0_5
| spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f66,f23,f14,f53]) ).
tff(f14,plain,
( spl0_1
<=> ( cP = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
tff(f23,plain,
( spl0_3
<=> ( cP = cQ ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
tff(f66,plain,
( ( cQ = $false )
| spl0_1
| ~ spl0_3 ),
inference(backward_demodulation,[],[f25,f64]) ).
tff(f64,plain,
( ( cP = $false )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f63]) ).
tff(f63,plain,
( ( $true != $true )
| ( cP = $false )
| spl0_1 ),
inference(fool_paramodulation,[],[f16]) ).
tff(f16,plain,
( ( cP != $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f14]) ).
tff(f25,plain,
( ( cP = cQ )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f23]) ).
tff(f62,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f61]) ).
tff(f61,plain,
( $false
| ~ spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f60]) ).
tff(f60,plain,
( ( $false = $true )
| ~ spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(backward_demodulation,[],[f15,f59]) ).
tff(f59,plain,
( ( cP = $false )
| ~ spl0_3
| ~ spl0_5 ),
inference(backward_demodulation,[],[f25,f55]) ).
tff(f15,plain,
( ( cP = $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f14]) ).
tff(f56,plain,
( ~ spl0_4
| spl0_5
| spl0_2 ),
inference(avatar_split_clause,[],[f43,f18,f53,f27]) ).
tff(f43,plain,
( ( cQ = $false )
| ( cR != $true )
| spl0_2 ),
inference(fool_paramodulation,[],[f20]) ).
tff(f20,plain,
( ( cQ != cR )
| spl0_2 ),
inference(avatar_component_clause,[],[f18]) ).
tff(f51,plain,
( ~ spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f50]) ).
tff(f50,plain,
( $false
| ~ spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(subsumption_resolution,[],[f49,f46]) ).
tff(f46,plain,
( ( cQ != $false )
| spl0_2
| spl0_4 ),
inference(backward_demodulation,[],[f20,f45]) ).
tff(f45,plain,
( ( cR = $false )
| spl0_4 ),
inference(trivial_inequality_removal,[],[f44]) ).
tff(f44,plain,
( ( cR = $false )
| ( $true != $true )
| spl0_4 ),
inference(fool_paramodulation,[],[f29]) ).
tff(f29,plain,
( ( cR != $true )
| spl0_4 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f49,plain,
( ( cQ = $false )
| ~ spl0_1
| spl0_3 ),
inference(trivial_inequality_removal,[],[f48]) ).
tff(f48,plain,
( ( $true != $true )
| ( cQ = $false )
| ~ spl0_1
| spl0_3 ),
inference(fool_paramodulation,[],[f41]) ).
tff(f41,plain,
( ( cQ != $true )
| ~ spl0_1
| spl0_3 ),
inference(backward_demodulation,[],[f24,f15]) ).
tff(f24,plain,
( ( cP != cQ )
| spl0_3 ),
inference(avatar_component_clause,[],[f23]) ).
tff(f40,plain,
( spl0_1
| ~ spl0_2
| spl0_3
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f39]) ).
tff(f39,plain,
( $false
| spl0_1
| ~ spl0_2
| spl0_3
| spl0_4 ),
inference(subsumption_resolution,[],[f38,f35]) ).
tff(f35,plain,
( ( cQ != $false )
| spl0_1
| spl0_3 ),
inference(backward_demodulation,[],[f24,f34]) ).
tff(f34,plain,
( ( cP = $false )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f33]) ).
tff(f33,plain,
( ( $true != $true )
| ( cP = $false )
| spl0_1 ),
inference(fool_paramodulation,[],[f16]) ).
tff(f38,plain,
( ( cQ = $false )
| ~ spl0_2
| spl0_4 ),
inference(subsumption_resolution,[],[f37,f29]) ).
tff(f37,plain,
( ( cR = $true )
| ( cQ = $false )
| ~ spl0_2 ),
inference(fool_paramodulation,[],[f19]) ).
tff(f32,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f9,f18,f14]) ).
tff(f9,plain,
( ( cP = $true )
| ( cQ = cR ) ),
inference(cnf_transformation,[],[f8]) ).
tff(f8,plain,
( ( ( cP = cQ )
| ( cR != $true ) )
& ( ( cR = $true )
| ( cP != cQ ) )
& ( ( cQ != cR )
| ( cP != $true ) )
& ( ( cQ = cR )
| ( cP = $true ) ) ),
inference(flattening,[],[f7]) ).
tff(f7,plain,
( ( ( cP = cQ )
| ( cR != $true ) )
& ( ( cR = $true )
| ( cP != cQ ) )
& ( ( cQ != cR )
| ( cP != $true ) )
& ( ( cQ = cR )
| ( cP = $true ) ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f6,plain,
( ( ( cP = cQ )
<=> ( cR = $true ) )
& ( ( cP = $true )
<~> ( cQ = cR ) ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,plain,
~ ( ( ( cP = cQ )
<=> ( cR = $true ) )
=> ( ( cQ = cR )
<=> ( cP = $true ) ) ),
inference(fool_elimination,[],[f4]) ).
tff(f4,plain,
~ ( ( cR
<=> ( cP
<=> cQ ) )
=> ( cP
<=> ( cR
<=> cQ ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( cR
<=> ( cP
<=> cQ ) )
=> ( cP
<=> ( cR
<=> cQ ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( cR
<=> ( cP
<=> cQ ) )
=> ( cP
<=> ( cR
<=> cQ ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM50_A) ).
tff(f31,plain,
( spl0_4
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f11,f23,f27]) ).
tff(f11,plain,
( ( cR = $true )
| ( cP != cQ ) ),
inference(cnf_transformation,[],[f8]) ).
tff(f30,plain,
( spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f12,f27,f23]) ).
tff(f12,plain,
( ( cR != $true )
| ( cP = cQ ) ),
inference(cnf_transformation,[],[f8]) ).
tff(f21,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f10,f18,f14]) ).
tff(f10,plain,
( ( cP != $true )
| ( cQ != cR ) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYO079^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14 % 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.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:29:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 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.15/0.40 % (5897)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 (2999ds/4Mi)
% 0.15/0.40 % (5896)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.40 % (5899)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.40 % (5900)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 (2999ds/2Mi)
% 0.15/0.40 % (5898)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 (2999ds/27Mi)
% 0.15/0.40 % (5901)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 (2999ds/275Mi)
% 0.15/0.40 % (5902)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.40 % (5903)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.40 % (5901)Refutation not found, incomplete strategy
% 0.15/0.40 % (5901)------------------------------
% 0.15/0.40 % (5901)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (5901)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.40
% 0.15/0.40
% 0.15/0.40 % (5901)Memory used [KB]: 5500
% 0.15/0.40 % (5901)Time elapsed: 0.004 s
% 0.15/0.40 % (5901)Instructions burned: 1 (million)
% 0.15/0.40 % (5901)------------------------------
% 0.15/0.40 % (5901)------------------------------
% 0.15/0.40 % (5899)Instruction limit reached!
% 0.15/0.40 % (5899)------------------------------
% 0.15/0.40 % (5899)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (5899)Termination reason: Unknown
% 0.15/0.40 % (5899)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (5900)Instruction limit reached!
% 0.15/0.40 % (5900)------------------------------
% 0.15/0.40 % (5900)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (5899)Memory used [KB]: 5500
% 0.15/0.40 % (5899)Time elapsed: 0.005 s
% 0.15/0.40 % (5899)Instructions burned: 2 (million)
% 0.15/0.40 % (5899)------------------------------
% 0.15/0.40 % (5899)------------------------------
% 0.15/0.40 % (5900)Termination reason: Unknown
% 0.15/0.40 % (5900)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (5900)Memory used [KB]: 5500
% 0.15/0.40 % (5900)Time elapsed: 0.005 s
% 0.15/0.40 % (5900)Instructions burned: 2 (million)
% 0.15/0.40 % (5900)------------------------------
% 0.15/0.40 % (5900)------------------------------
% 0.15/0.40 % (5897)First to succeed.
% 0.15/0.40 % (5902)Also succeeded, but the first one will report.
% 0.15/0.40 % (5903)Instruction limit reached!
% 0.15/0.40 % (5903)------------------------------
% 0.15/0.40 % (5903)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (5903)Termination reason: Unknown
% 0.15/0.40 % (5903)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (5903)Memory used [KB]: 5500
% 0.15/0.40 % (5903)Time elapsed: 0.006 s
% 0.15/0.40 % (5903)Instructions burned: 3 (million)
% 0.15/0.40 % (5903)------------------------------
% 0.15/0.40 % (5903)------------------------------
% 0.15/0.40 % (5897)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.40 % (5897)------------------------------
% 0.15/0.40 % (5897)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (5897)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (5897)Memory used [KB]: 5500
% 0.15/0.40 % (5897)Time elapsed: 0.007 s
% 0.15/0.40 % (5897)Instructions burned: 2 (million)
% 0.15/0.40 % (5897)------------------------------
% 0.15/0.40 % (5897)------------------------------
% 0.15/0.40 % (5895)Success in time 0.03 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------