%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL180-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:52 AM UTC 2026
% Result : Unsatisfiable 0.37s 0.68s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 22 unt; 1 def)
% Number of atoms : 67 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 29 ~; 24 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 55 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(not(not(p)),p)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f15,plain,
! [X0,X1] :
( theorem(X0)
| ~ theorem(or(not(X1),X0))
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(not(not(p))),p)),
inference(definition_unfolding,[],[f9,f6]) ).
fof(f17,plain,
! [X0] :
( ~ theorem(X0)
| ~ axiom(X0) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f18,plain,
! [X0,X1] :
( theorem(or(not(X1),X0))
| ~ theorem(X0)
| theorem(X1) ),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f19,plain,
theorem(or(not(not(not(p))),p)),
inference(consistent_polarity_flipping,[],[f16]) ).
fof(f21,plain,
! [X0,X1] :
( ~ axiom(or(not(X1),X0))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f18,f17]) ).
fof(f22,plain,
! [X0] :
( theorem(or(X0,X0))
| ~ theorem(X0) ),
inference(resolution,[],[f21,f10]) ).
fof(f23,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f21,f12]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f21,f13]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(or(X2,X0)),or(X2,X1)))
| theorem(or(not(X0),X1)) ),
inference(resolution,[],[f21,f14]) ).
fof(f31,plain,
theorem(or(p,not(not(not(p))))),
inference(resolution,[],[f23,f19]) ).
fof(f35,plain,
! [X0,X1] :
( theorem(or(X0,or(or(X0,X1),X1)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f24,f22]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,X1))
| theorem(or(not(X0),X1))
| theorem(or(X2,X0)) ),
inference(resolution,[],[f25,f18]) ).
fof(f55,plain,
! [X0,X1] :
( ~ axiom(or(X0,or(or(X0,X1),X1)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f35,f17]) ).
fof(f67,plain,
! [X0] :
( theorem(or(not(X0),not(not(not(p)))))
| theorem(or(p,X0)) ),
inference(resolution,[],[f36,f31]) ).
fof(f74,plain,
! [X0] :
( theorem(or(not(not(not(p))),not(X0)))
| theorem(or(p,X0)) ),
inference(resolution,[],[f67,f23]) ).
fof(f256,definition,
( spl0_9
<=> ! [X1] : ~ theorem(or(not(X1),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f257,plain,
( ! [X1] : ~ theorem(or(not(X1),X1))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f1167,plain,
! [X0] : ~ theorem(or(not(X0),X0)),
inference(resolution,[],[f55,f11]) ).
fof(f1168,plain,
spl0_9,
inference(avatar_split_clause,[],[f1167,f256]) ).
fof(f1614,plain,
( theorem(or(p,not(p)))
| ~ spl0_9 ),
inference(resolution,[],[f257,f74]) ).
fof(f1773,plain,
( theorem(or(not(p),p))
| ~ spl0_9 ),
inference(resolution,[],[f1614,f23]) ).
fof(f1778,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1773,f257]) ).
fof(f1779,plain,
~ spl0_9,
inference(avatar_contradiction_clause,[],[f1778]) ).
cnf(s59,plain,
spl0_9,
inference(sat_conversion,[],[f1168]) ).
cnf(s101,plain,
~ spl0_9,
inference(sat_conversion,[],[f1779]) ).
cnf(s105,plain,
$false,
inference(rat,[],[s59,s101]) ).
fof(f1780,plain,
$false,
inference(avatar_sat_refutation,[],[s105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL180-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.23/0.48 % Computer : n009.cluster.edu
% 0.23/0.48 % Model : x86_64 x86_64
% 0.23/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.48 % Memory : 8046.5625MB
% 0.23/0.48 % OS : Linux 6.8.0-71-generic
% 0.23/0.48 % CPULimit : 300
% 0.23/0.48 % WCLimit : 300
% 0.23/0.48 % DateTime : Sun Sep 27 15:25:15 UTC 2026
% 0.23/0.49 % CPUTime :
% 0.23/0.49 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.27/0.54 Running first-order model finding
% 0.27/0.54 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.68 % (2169723)Will run a generic schedule for satisfiability detection.
% 0.37/0.68 % (2169731)dis+10_1_sil=32000:sp=arity:random_seed=1090763779:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.37/0.68 % (2169729)% WARNING: option uhcvi not known.
% 0.37/0.68 % (2169732)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2697662586:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.37/0.68 % (2169730)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3014171621:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.37/0.68 % (2169728)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=441119948_2999 on theBenchmark for (2999ds/0Mi)
% 0.37/0.68 % (2169729)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=344089565:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.37/0.68 % (2169733)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1187855069:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.37/0.68 % (2169734)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3337524461:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.37/0.68 % TRYING [1]
% 0.37/0.68 % TRYING [2]
% 0.37/0.68 % TRYING [3]
% 0.37/0.68 % TRYING [4]
% 0.37/0.68 % (2169731)Instruction limit reached!
% 0.37/0.68 % (2169731)------------------------------
% 0.37/0.68 % (2169731)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.68 % (2169731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.68 % (2169731)CaDiCaL version: 2.1.3
% 0.37/0.68 % (2169731)Termination reason: Instruction limit
% 0.37/0.68 % (2169731)Termination phase: Saturation
% 0.37/0.68 % (2169731)Time elapsed: 0.052 s
% 0.37/0.68 % (2169731)Peak memory usage: 12 MB
% 0.37/0.68 % (2169731)Instructions burned: 103 (million)
% 0.37/0.68 % (2169729) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2169723-2169729"...
% 0.37/0.68 % (2169729)...printing done.
% 0.37/0.68 % (2169729)Refutation found. Thanks to Tanya!
% 0.37/0.68 % SZS status Unsatisfiable for theBenchmark
% 0.37/0.68 % SZS output start Proof for theBenchmark
% See solution above
% 0.37/0.68 % (2169729)------------------------------
% 0.37/0.68 % (2169729)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.68 % (2169729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.68 % (2169729)CaDiCaL version: 2.1.3
% 0.37/0.68 % (2169729)Termination reason: Refutation
% 0.37/0.68 % (2169729)Time elapsed: 0.075 s
% 0.37/0.68 % (2169729)Peak memory usage: 12 MB
% 0.37/0.68 % (2169729)Instructions burned: 75 (million)
% 0.37/0.68 % (2169723)Success in time 0.122 s
% 0.37/0.68 % Vampire exiting
%------------------------------------------------------------------------------