%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL008-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:50:54 AM UTC 2026
% Result : Unsatisfiable 3.95s 1.53s
% Output : Refutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 12 unt; 1 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 16 ~; 12 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yql) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ec_4) ).
fof(f4,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f2,f1]) ).
fof(f6,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X0,X2)) ),
inference(resolution,[],[f4,f1]) ).
fof(f7,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))))
| is_a_theorem(equivalent(X0,equivalent(X3,X2))) ),
inference(resolution,[],[f6,f2]) ).
fof(f8,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X0,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(resolution,[],[f6,f4]) ).
fof(f9,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(resolution,[],[f7,f2]) ).
fof(f13,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),equivalent(X2,X1))),
inference(resolution,[],[f9,f7]) ).
fof(f14,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X2)) ),
inference(resolution,[],[f9,f8]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X0)))
| is_a_theorem(equivalent(X2,X1)) ),
inference(resolution,[],[f13,f1]) ).
fof(f29,plain,
~ is_a_theorem(equivalent(a,a)),
inference(resolution,[],[f14,f3]) ).
fof(f48,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[],[f24,f9]) ).
fof(f57,definition,
( spl0_2
<=> ! [X0] : is_a_theorem(equivalent(X0,X0)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f58,plain,
( ! [X0] : is_a_theorem(equivalent(X0,X0))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f60,plain,
spl0_2,
inference(avatar_split_clause,[],[f48,f57]) ).
fof(f76,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f58,f29]) ).
fof(f79,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f76]) ).
cnf(s2,plain,
spl0_2,
inference(sat_conversion,[],[f60]) ).
cnf(s4,plain,
~ spl0_2,
inference(sat_conversion,[],[f79]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s4]) ).
fof(f80,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n012.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 15:16:35 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.95/1.53 % (2493911)Input is clausal, will run a generic CNF schedule.
% 3.95/1.53 % (2493916)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1179512559:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.95/1.53 % (2493917)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3862291476:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.95/1.53 % (2493919)lrs+10_1_sil=8000:sp=occurrence:random_seed=275033193:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.95/1.53 % (2493918)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1259138128:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.95/1.53 % (2493919)First to succeed.
% 3.95/1.53 % (2493919)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2493911"
% 3.95/1.53 % (2493921)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2806103201:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.95/1.53 % (2493920)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1130894391:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.95/1.53 % (2493921)Also succeeded, but the first one will report.
% 3.95/1.53 % (2493922)dis-21_1_sil=8000:lcm=predicate:random_seed=1306464630:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.95/1.53 % (2493922)Also succeeded, but the first one will report.
% 3.95/1.53 % (2493920)Instruction limit reached!
% 3.95/1.53 % (2493920)------------------------------
% 3.95/1.53 % (2493920)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.95/1.53 % (2493920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.53 % (2493920)CaDiCaL version: 2.1.3
% 3.95/1.53 % (2493920)Termination reason: Instruction limit
% 3.95/1.53 % (2493920)Termination phase: Saturation
% 3.95/1.53 % (2493920)Time elapsed: 0.058 s
% 3.95/1.53 % (2493920)Peak memory usage: 88 MB
% 3.95/1.53 % (2493920)Instructions burned: 116 (million)
% 3.95/1.53 % (2493919)Refutation found. Thanks to Tanya!
% 3.95/1.53 % SZS status Unsatisfiable for theBenchmark
% 3.95/1.53 % SZS output start Proof for theBenchmark
% See solution above
% 3.95/1.53 % (2493919)------------------------------
% 3.95/1.53 % (2493919)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.95/1.53 % (2493919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.53 % (2493919)CaDiCaL version: 2.1.3
% 3.95/1.53 % (2493919)Termination reason: Refutation
% 3.95/1.53 % (2493919)Time elapsed: 0.003 s
% 3.95/1.53 % (2493919)Peak memory usage: 89 MB
% 3.95/1.53 % (2493919)Instructions burned: 3 (million)
% 3.95/1.53 % (2493919)------------------------------
% 3.95/1.53 % (2493919)------------------------------
% 3.95/1.53 % (2493911)Success in time 0.478 s
% 3.95/1.53 % Vampire exiting
%------------------------------------------------------------------------------