TSTP Solution File: SYO039_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO039_8 : TPTP v8.1.2. Released v8.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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 : Sun May 5 12:19:05 EDT 2024
% Result : Theorem 0.62s 0.81s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 9 unt; 3 typ; 0 def)
% Number of atoms : 106 ( 31 equ)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 40 ( 20 ~; 15 |; 1 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 64 ( 62 fml; 2 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 6 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 1 ( 1 !; 0 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
h: $o > $i ).
tff(func_def_3,type,
bG0: $o ).
tff(func_def_4,type,
bG1: $o ).
tff(f42,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f28,f40]) ).
tff(f40,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f39]) ).
tff(f39,plain,
( $false
| spl2_1 ),
inference(trivial_inequality_removal,[],[f38]) ).
tff(f38,plain,
( ( h($false) != h($false) )
| spl2_1 ),
inference(superposition,[],[f14,f35]) ).
tff(f35,plain,
( ( $false = bG1 )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f32]) ).
tff(f32,plain,
( ( $true != $true )
| ( $false = bG1 )
| spl2_1 ),
inference(superposition,[],[f20,f4]) ).
tff(f4,plain,
! [X0: $o] :
( ( $true = (X0) )
| ( $false = (X0) ) ),
introduced(fool_axiom,[]) ).
tff(f20,plain,
( ( $true != bG1 )
| spl2_1 ),
inference(avatar_component_clause,[],[f18]) ).
tff(f18,plain,
( spl2_1
<=> ( $true = bG1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f14,plain,
h($false) != h(bG1),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
h($false) != h(bG1),
inference(flattening,[],[f7]) ).
tff(f7,plain,
( ~ h($false) = h(bG1) ),
inference(fool_elimination,[],[f2,f6,f5]) ).
tff(f5,plain,
( ~ $false
<=> ( $true = bG0 ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG0])]) ).
tff(f6,plain,
( ( h($false) = h(bG0) )
<=> ( $true = bG1 ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG1])]) ).
tff(f2,negated_conjecture,
( ~ h(h($false) = h(~ $false)) = h($false) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
h(h($false) = h(~ $false)) = h($false),
file('/export/starexec/sandbox2/tmp/tmp.jzPQG2L7Qc/Vampire---4.8_18876',1) ).
tff(f28,plain,
( ~ spl2_2
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f27,f18,f22]) ).
tff(f22,plain,
( spl2_2
<=> ( h($false) = h($true) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f27,plain,
( ( h($false) != h($true) )
| ~ spl2_1 ),
inference(superposition,[],[f14,f19]) ).
tff(f19,plain,
( ( $true = bG1 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f18]) ).
tff(f25,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f15,f22,f18]) ).
tff(f15,plain,
( ( h($false) = h($true) )
| ( $true != bG1 ) ),
inference(definition_unfolding,[],[f12,f13]) ).
tff(f13,plain,
$true = bG0,
inference(cnf_transformation,[],[f8]) ).
tff(f8,plain,
$true = bG0,
inference(true_and_false_elimination,[],[f5]) ).
tff(f12,plain,
( ( h($false) = h(bG0) )
| ( $true != bG1 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f10,plain,
( ( ( h($false) = h(bG0) )
| ( $true != bG1 ) )
& ( ( $true = bG1 )
| ( h($false) != h(bG0) ) ) ),
inference(nnf_transformation,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYO039_8 : TPTP v8.1.2. Released v8.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n018.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 15:53:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TX0_THM_EQU_NAR problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.jzPQG2L7Qc/Vampire---4.8_18876
% 0.62/0.80 % (19112)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.62/0.81 % (19113)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.81 % (19111)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.62/0.81 % (19114)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.81 % (19115)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.62/0.81 % (19119)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.62/0.81 % (19116)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.81 % (19112)First to succeed.
% 0.62/0.81 % (19112)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19032"
% 0.62/0.81 % (19115)Refutation not found, incomplete strategy% (19115)------------------------------
% 0.62/0.81 % (19115)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (19115)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81
% 0.62/0.81 % (19115)Memory used [KB]: 964
% 0.62/0.81 % (19111)Refutation not found, incomplete strategy% (19111)------------------------------
% 0.62/0.81 % (19111)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (19115)Time elapsed: 0.003 s
% 0.62/0.81 % (19115)Instructions burned: 2 (million)
% 0.62/0.81 % (19113)Also succeeded, but the first one will report.
% 0.62/0.81 % (19111)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81 % (19119)Refutation not found, incomplete strategy% (19119)------------------------------
% 0.62/0.81 % (19119)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (19119)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81
% 0.62/0.81 % (19119)Memory used [KB]: 950
% 0.62/0.81 % (19119)Time elapsed: 0.002 s
% 0.62/0.81 % (19119)Instructions burned: 2 (million)
% 0.62/0.81
% 0.62/0.81 % (19111)Memory used [KB]: 967
% 0.62/0.81 % (19111)Time elapsed: 0.003 s
% 0.62/0.81 % (19111)Instructions burned: 2 (million)
% 0.62/0.81 % (19114)Refutation not found, incomplete strategy% (19114)------------------------------
% 0.62/0.81 % (19114)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (19115)------------------------------
% 0.62/0.81 % (19115)------------------------------
% 0.62/0.81 % (19114)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81
% 0.62/0.81 % (19114)Memory used [KB]: 962
% 0.62/0.81 % (19114)Time elapsed: 0.003 s
% 0.62/0.81 % (19114)Instructions burned: 2 (million)
% 0.62/0.81 % (19119)------------------------------
% 0.62/0.81 % (19119)------------------------------
% 0.62/0.81 % (19111)------------------------------
% 0.62/0.81 % (19111)------------------------------
% 0.62/0.81 % (19116)Also succeeded, but the first one will report.
% 0.62/0.81 % (19114)------------------------------
% 0.62/0.81 % (19114)------------------------------
% 0.62/0.81 % (19112)Refutation found. Thanks to Tanya!
% 0.62/0.81 % SZS status Theorem for Vampire---4
% 0.62/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.81 % (19112)------------------------------
% 0.62/0.81 % (19112)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (19112)Termination reason: Refutation
% 0.62/0.81
% 0.62/0.81 % (19112)Memory used [KB]: 992
% 0.62/0.81 % (19112)Time elapsed: 0.003 s
% 0.62/0.81 % (19112)Instructions burned: 3 (million)
% 0.62/0.81 % (19032)Success in time 0.443 s
% 0.62/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------