%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL261-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:58:14 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.41s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 27 unt; 1 def)
% Number of atoms : 56 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 15 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,negated_conjecture,
~ theorem(or(not(p),or(not(q),and(p,q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f13,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f15,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(f16,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f17,plain,
~ theorem(or(not(p),or(not(q),not(or(not(p),not(q)))))),
inference(definition_unfolding,[],[f10,f9]) ).
fof(f18,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f11,f7]) ).
fof(f19,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f20,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f13,f7]) ).
fof(f21,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f16,f18]) ).
fof(f23,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f14,f7]) ).
fof(f27,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f15,f7]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f23,f16]) ).
fof(f36,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f27,f16]) ).
fof(f54,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f30,f19]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f36,f16]) ).
fof(f65,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f54,f21]) ).
fof(f71,definition,
( spl0_4
<=> ! [X0] : theorem(or(not(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f72,plain,
( ! [X0] : theorem(or(not(X0),X0))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f99,plain,
spl0_4,
inference(avatar_split_clause,[],[f65,f71]) ).
fof(f110,plain,
( ! [X0,X1] : theorem(or(X0,or(not(or(X0,X1)),X1)))
| ~ spl0_4 ),
inference(resolution,[],[f72,f30]) ).
fof(f121,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f57,f20]) ).
fof(f355,plain,
( ! [X0,X1] : theorem(or(X0,or(X1,not(or(X0,X1)))))
| ~ spl0_4 ),
inference(resolution,[],[f121,f110]) ).
fof(f1023,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f355,f17]) ).
fof(f1029,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f1023]) ).
cnf(s12,plain,
spl0_4,
inference(sat_conversion,[],[f99]) ).
cnf(s42,plain,
~ spl0_4,
inference(sat_conversion,[],[f1029]) ).
cnf(s52,plain,
$false,
inference(rat,[],[s12,s42]) ).
fof(f1030,plain,
$false,
inference(avatar_sat_refutation,[],[s52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL261-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.34 % Computer : n012.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sun Sep 27 15:31:19 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.37 Running first-order model finding
% 0.08/0.37 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.08/0.41 % (2519894)Will run a generic schedule for satisfiability detection.
% 0.08/0.41 % (2519905)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3309652246:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.08/0.41 % (2519900)% WARNING: option uhcvi not known.
% 0.08/0.41 % (2519899)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3330964644_3000 on theBenchmark for (3000ds/0Mi)
% 0.08/0.41 % (2519902)dis+10_1_sil=32000:sp=arity:random_seed=3525156507:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.08/0.41 % (2519900)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=494060444:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.08/0.41 % (2519901)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1468759635:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.08/0.41 % (2519904)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4218138551:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.08/0.41 % (2519903)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3337855111:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.08/0.41 % TRYING [1]
% 0.08/0.41 % TRYING [2]
% 0.08/0.41 % TRYING [3]
% 0.08/0.41 % (2519902) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2519894-2519902"...
% 0.08/0.41 % TRYING [4]
% 0.08/0.41 % (2519902)...printing done.
% 0.08/0.41 % (2519902)Refutation found. Thanks to Tanya!
% 0.08/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.41 % (2519902)------------------------------
% 0.08/0.41 % (2519902)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.41 % (2519902)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.41 % (2519902)CaDiCaL version: 2.1.3
% 0.08/0.41 % (2519902)Termination reason: Refutation
% 0.08/0.41 % (2519902)Time elapsed: 0.017 s
% 0.08/0.41 % (2519902)Peak memory usage: 12 MB
% 0.08/0.41 % (2519902)Instructions burned: 30 (million)
% 0.08/0.41 % (2519894)Success in time 0.039 s
% 0.08/0.41 % Vampire exiting
%------------------------------------------------------------------------------