%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:59 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 23 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
fof(f6,axiom,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( theorem(X0)
| ~ axiom(or(not(X1),X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
fof(f8,axiom,
! [X2,X0,X1] :
( theorem(or(not(X0),X1))
| ~ axiom(or(not(X0),X2))
| ~ theorem(or(not(X2),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
fof(f9,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(q),p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
! [X0] :
( ~ theorem(X0)
| ~ axiom(X0) ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f11,plain,
! [X0,X1] :
( ~ axiom(or(not(X1),X0))
| ~ theorem(X0)
| theorem(X1) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f12,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X2),X1)) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f13,plain,
theorem(or(not(not(or(not(p),q))),or(not(q),p))),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f15,plain,
! [X0] :
( theorem(or(X0,X0))
| ~ theorem(X0) ),
inference(resolution,[],[f11,f1]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[],[f4,f11]) ).
fof(f21,plain,
! [X0] :
( ~ axiom(or(not(not(or(not(p),q))),X0))
| theorem(or(not(X0),or(not(q),p))) ),
inference(resolution,[],[f12,f13]) ).
fof(f23,plain,
! [X0] : theorem(or(not(or(X0,not(or(not(p),q)))),or(not(q),p))),
inference(resolution,[],[f21,f2]) ).
fof(f34,plain,
! [X0,X1] :
( theorem(or(X0,or(or(X0,X1),X1)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f18,f15]) ).
fof(f44,plain,
! [X0] : theorem(or(not(q),or(not(or(X0,not(or(not(p),q)))),p))),
inference(resolution,[],[f23,f18]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(X0),X2))
| ~ theorem(or(not(X0),X1))
| theorem(or(not(X2),or(or(not(X0),X1),X1))) ),
inference(resolution,[],[f34,f12]) ).
fof(f79,plain,
! [X0,X1] :
( ~ axiom(or(not(q),X0))
| theorem(or(not(X0),or(not(or(X1,not(or(not(p),q)))),p))) ),
inference(resolution,[],[f44,f12]) ).
fof(f101,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X1,X0)),or(or(not(or(X0,X1)),X2),X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[],[f50,f3]) ).
fof(f145,plain,
! [X0,X1] : theorem(or(not(or(X0,q)),or(not(or(X1,not(or(not(p),q)))),p))),
inference(resolution,[],[f79,f2]) ).
fof(f225,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(or(X1,X0)),or(or(not(or(X0,X1)),X2),X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[],[f101,f10]) ).
fof(f280,plain,
! [X0,X1] : theorem(or(not(or(X0,not(or(not(p),q)))),or(not(or(X1,q)),p))),
inference(resolution,[],[f145,f18]) ).
fof(f558,plain,
! [X0,X1] : ~ theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f225,f2]) ).
fof(f1084,plain,
$false,
inference(resolution,[],[f558,f280]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n006.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:26:41 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.40 Running first-order model finding
% 0.10/0.40 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.17/0.46 % (3098192)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (3098198)% WARNING: option uhcvi not known.
% 0.17/0.46 % (3098198)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3608481232:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (3098197)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3697498719_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % (3098199)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=738990714:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (3098200)dis+10_1_sil=32000:sp=arity:random_seed=1754102445:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (3098201)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4185690972:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % TRYING [1]
% 0.17/0.46 % TRYING [2]
% 0.17/0.46 % TRYING [3]
% 0.17/0.46 % (3098198) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3098192-3098198"...
% 0.17/0.46 % (3098198)...printing done.
% 0.17/0.46 % (3098198)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (3098198)------------------------------
% 0.17/0.46 % (3098198)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (3098198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (3098198)CaDiCaL version: 2.1.3
% 0.17/0.46 % (3098198)Termination reason: Refutation
% 0.17/0.46 % (3098198)Time elapsed: 0.014 s
% 0.17/0.46 % (3098198)Peak memory usage: 11 MB
% 0.17/0.46 % (3098198)Instructions burned: 38 (million)
% 0.17/0.46 % (3098192)Success in time 0.048 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------