%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL101-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:57:39 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 14 unt; 1 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 31 ~; 19 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 70 ( 0 sgn 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',prove_p_1) ).
fof(f5,plain,
! [X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f7,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f8,plain,
is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f9,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,[],[f6,f5]) ).
fof(f10,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,[],[f7,f5]) ).
fof(f11,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,[],[f9,f7]) ).
fof(f14,plain,
! [X2,X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(resolution,[],[f11,f9]) ).
fof(f17,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(f18,plain,
( ! [X3,X4,X5] : ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),equivalent(X4,X5)))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f23,plain,
spl0_1,
inference(avatar_split_clause,[],[f14,f17]) ).
fof(f24,plain,
( ! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2)))
| ~ is_a_theorem(equivalent(X1,X2)) )
| ~ spl0_1 ),
inference(resolution,[],[f18,f5]) ).
fof(f25,plain,
( ! [X0,X1] : ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1)))
| ~ spl0_1 ),
inference(resolution,[],[f24,f11]) ).
fof(f27,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,[],[f24,f10]) ).
fof(f34,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1))))
| ~ spl0_1 ),
inference(resolution,[],[f27,f25]) ).
fof(f35,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,[],[f27,f7]) ).
fof(f40,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,[],[f34,f9]) ).
fof(f57,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X2,X3)))
| is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3)))) )
| ~ spl0_1 ),
inference(resolution,[],[f40,f5]) ).
fof(f161,plain,
( ! [X0] : is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(X0,equivalent(e,b)),equivalent(X0,equivalent(equivalent(a,e),c)))))
| ~ spl0_1 ),
inference(resolution,[],[f57,f8]) ).
fof(f320,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f161,f35]) ).
fof(f326,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f320]) ).
cnf(s2,plain,
spl0_1,
inference(sat_conversion,[],[f23]) ).
cnf(s6,plain,
~ spl0_1,
inference(sat_conversion,[],[f326]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s2,s6]) ).
fof(f327,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----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/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 15:16:50 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.47 % (2718777)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (2718797)% WARNING: option uhcvi not known.
% 0.18/0.47 % (2718797)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1929525207:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (2718797) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2718777-2718797"...
% 0.18/0.47 % (2718800)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=574403305:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (2718796)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=165567531_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % (2718799)dis+10_1_sil=32000:sp=arity:random_seed=2170797054:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (2718797)...printing done.
% 0.18/0.47 % (2718798)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3826236880:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (2718797)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (2718797)------------------------------
% 0.18/0.47 % (2718797)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (2718797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (2718797)CaDiCaL version: 2.1.3
% 0.18/0.47 % (2718797)Termination reason: Refutation
% 0.18/0.47 % (2718797)Time elapsed: 0.007 s
% 0.18/0.47 % (2718797)Peak memory usage: 12 MB
% 0.18/0.47 % (2718797)Instructions burned: 15 (million)
% 0.18/0.47 % (2718777)Success in time 0.043 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------