%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL101-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 : n002.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:51:12 AM UTC 2026
% Result : Unsatisfiable 3.68s 1.43s
% Output : Refutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 11 unt; 1 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 17 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 63 !; 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,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).
fof(f3,axiom,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p_4) ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p_1) ).
fof(f5,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3))
| is_a_theorem(X3) ),
inference(resolution,[],[f2,f1]) ).
fof(f6,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f3,f1]) ).
fof(f7,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),equivalent(X4,X5)))),
inference(resolution,[],[f5,f3]) ).
fof(f10,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(resolution,[],[f7,f5]) ).
fof(f13,definition,
( spl0_1
<=> ! [X4,X5,X3] : is_a_theorem(equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),equivalent(X4,X5))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f14,plain,
( ! [X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),equivalent(X4,X5)))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f13]) ).
fof(f19,plain,
spl0_1,
inference(avatar_split_clause,[],[f10,f13]) ).
fof(f20,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2)))
| is_a_theorem(equivalent(X1,X2)) )
| ~ spl0_1 ),
inference(resolution,[],[f14,f1]) ).
fof(f21,plain,
( ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1)))
| ~ spl0_1 ),
inference(resolution,[],[f20,f7]) ).
fof(f23,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2))
| is_a_theorem(equivalent(equivalent(X0,X1),X2)) )
| ~ spl0_1 ),
inference(resolution,[],[f20,f6]) ).
fof(f30,plain,
( ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1))))
| ~ spl0_1 ),
inference(resolution,[],[f23,f21]) ).
fof(f31,plain,
( ! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),equivalent(equivalent(X5,X0),equivalent(X5,X1)))))
| ~ spl0_1 ),
inference(resolution,[],[f23,f3]) ).
fof(f36,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))))
| ~ spl0_1 ),
inference(resolution,[],[f30,f5]) ).
fof(f58,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))))
| is_a_theorem(equivalent(X0,equivalent(X2,X3))) )
| ~ spl0_1 ),
inference(resolution,[],[f36,f1]) ).
fof(f172,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2))))
| ~ spl0_1 ),
inference(resolution,[],[f58,f31]) ).
fof(f831,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f172,f4]) ).
fof(f839,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f831]) ).
cnf(s2,plain,
spl0_1,
inference(sat_conversion,[],[f19]) ).
cnf(s35,plain,
~ spl0_1,
inference(sat_conversion,[],[f839]) ).
cnf(s36,plain,
$false,
inference(rat,[],[s2,s35]) ).
fof(f840,plain,
$false,
inference(avatar_sat_refutation,[],[s36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL101-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 : n002.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:24:06 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.68/1.43 % (3664071)Input is clausal, will run a generic CNF schedule.
% 3.68/1.43 % (3664153)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1740766615:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.68/1.43 % (3664148)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=992434118:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.68/1.43 % (3664147)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=2956762021:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.68/1.43 % (3664154)lrs+10_1_sil=8000:sp=occurrence:random_seed=1714703097:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.68/1.43 % (3664157)dis-21_1_sil=8000:lcm=predicate:random_seed=510325458: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.68/1.43 % (3664155)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3270666170:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.68/1.43 % (3664155)Also succeeded, but the first one will report.
% 3.68/1.43 % (3664157)First to succeed.
% 3.68/1.43 % (3664157)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3664071"
% 3.68/1.43 % (3664156)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2212596591:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.68/1.43 % (3664156)Also succeeded, but the first one will report.
% 3.68/1.43 % (3664154)Instruction limit reached!
% 3.68/1.43 % (3664154)------------------------------
% 3.68/1.43 % (3664154)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.43 % (3664154)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.43 % (3664154)CaDiCaL version: 2.1.3
% 3.68/1.43 % (3664154)Termination reason: Instruction limit
% 3.68/1.43 % (3664154)Termination phase: Saturation
% 3.68/1.43 % (3664154)Time elapsed: 0.073 s
% 3.68/1.43 % (3664154)Peak memory usage: 88 MB
% 3.68/1.43 % (3664154)Instructions burned: 107 (million)
% 3.68/1.43 % (3664165)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2811230487:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.68/1.43 % (3664165)Refutation not found, incomplete strategy
% 3.68/1.43 % (3664165)------------------------------
% 3.68/1.43 % (3664165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.43 % (3664165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.43 % (3664165)CaDiCaL version: 2.1.3
% 3.68/1.43 % (3664165)Termination reason: Refutation not found, incomplete strategy
% 3.68/1.43 % (3664165)Time elapsed: 0.001 s
% 3.68/1.43 % (3664165)Peak memory usage: 87 MB
% 3.68/1.43 % (3664157)Refutation found. Thanks to Tanya!
% 3.68/1.43 % SZS status Unsatisfiable for theBenchmark
% 3.68/1.43 % SZS output start Proof for theBenchmark
% See solution above
% 3.68/1.43 % (3664157)------------------------------
% 3.68/1.43 % (3664157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.43 % (3664157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.43 % (3664157)CaDiCaL version: 2.1.3
% 3.68/1.43 % (3664157)Termination reason: Refutation
% 3.68/1.43 % (3664157)Time elapsed: 0.022 s
% 3.68/1.43 % (3664157)Peak memory usage: 89 MB
% 3.68/1.43 % (3664157)Instructions burned: 29 (million)
% 3.68/1.43 % (3664157)------------------------------
% 3.68/1.43 % (3664157)------------------------------
% 3.68/1.43 % (3664071)Success in time 0.45 s
% 3.68/1.43 % Vampire exiting
%------------------------------------------------------------------------------