%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL202-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 : 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:57:58 AM UTC 2026
% Result : Unsatisfiable 0.43s 0.57s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 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 : 55 ( 55 !; 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] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( ~ axiom(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
fof(f9,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(p,not(q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f21,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f2,f6]) ).
fof(f29,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f7,f1]) ).
fof(f30,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f7,f3]) ).
fof(f31,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f7,f2]) ).
fof(f77,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f4,f7]) ).
fof(f87,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f77,f21]) ).
fof(f89,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f77,f31]) ).
fof(f104,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f87,f29]) ).
fof(f106,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f104,f30]) ).
fof(f142,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f89,f29]) ).
fof(f143,plain,
! [X2,X0,X1] :
( theorem(or(or(X2,X1),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f89,f30]) ).
fof(f180,plain,
! [X2,X3,X0,X1] :
( theorem(or(X0,or(or(X3,X2),X1)))
| ~ theorem(or(or(X0,X1),X2)) ),
inference(resolution,[],[f143,f77]) ).
fof(f1716,plain,
! [X2,X3,X0,X1] :
( theorem(or(or(or(X3,X2),X1),X0))
| ~ theorem(or(or(X0,X1),X2)) ),
inference(resolution,[],[f180,f30]) ).
fof(f1994,plain,
! [X2,X0,X1] :
( ~ theorem(or(or(X0,X0),X1))
| theorem(or(or(X2,X1),X0)) ),
inference(resolution,[],[f1716,f142]) ).
fof(f2006,plain,
! [X2,X0,X1] :
( theorem(or(or(X0,X1),X2))
| ~ theorem(or(X1,X2)) ),
inference(resolution,[],[f1994,f143]) ).
fof(f2456,plain,
! [X2,X0,X1] :
( theorem(or(X1,or(X2,X0)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f2006,f30]) ).
fof(f2593,plain,
~ theorem(or(not(q),not(not(or(p,q))))),
inference(resolution,[],[f2456,f9]) ).
fof(f3731,plain,
! [X0,X1] :
( theorem(or(not(X0),not(not(X1))))
| ~ axiom(or(not(X0),X1)) ),
inference(resolution,[],[f8,f106]) ).
fof(f4553,plain,
~ axiom(or(not(q),or(p,q))),
inference(resolution,[],[f3731,f2593]) ).
fof(f4559,plain,
$false,
inference(forward_subsumption_resolution,[],[f4553,f2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL202-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.21/0.47 % Computer : n002.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Sun Sep 27 15:29:07 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.50 Running first-order model finding
% 0.25/0.50 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.43/0.57 % (3675659)Will run a generic schedule for satisfiability detection.
% 0.43/0.57 % (3675671)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3862718232:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.43/0.57 % (3675669)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2951925805_2999 on theBenchmark for (2999ds/0Mi)
% 0.43/0.57 % (3675672)dis+10_1_sil=32000:sp=arity:random_seed=3993957458:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.43/0.57 % (3675673)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4224301220:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.43/0.57 % (3675674)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3878002552:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.43/0.57 % TRYING [1]
% 0.43/0.57 % TRYING [2]
% 0.43/0.57 % TRYING [3]
% 0.43/0.57 % (3675670)% WARNING: option uhcvi not known.
% 0.43/0.57 % (3675675)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1445719793:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.43/0.57 % (3675670)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4150552957:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.43/0.57 % (3675671) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3675659-3675671"...
% 0.43/0.57 % (3675671)...printing done.
% 0.43/0.57 % (3675671)Refutation found. Thanks to Tanya!
% 0.43/0.57 % SZS status Unsatisfiable for theBenchmark
% 0.43/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.43/0.57 % (3675671)------------------------------
% 0.43/0.57 % (3675671)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.43/0.57 % (3675671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.43/0.57 % (3675671)CaDiCaL version: 2.1.3
% 0.43/0.57 % (3675671)Termination reason: Refutation
% 0.43/0.57 % (3675671)Time elapsed: 0.033 s
% 0.43/0.57 % (3675671)Peak memory usage: 12 MB
% 0.43/0.57 % (3675671)Instructions burned: 98 (million)
% 0.43/0.57 % (3675659)Success in time 0.062 s
% 0.43/0.57 % Vampire exiting
%------------------------------------------------------------------------------