%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL199-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 : n018.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:57 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.53s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 32 unt; 0 def)
% Number of atoms : 70 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 38 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 97 ( 97 !; 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] :
( theorem(X0)
| ~ axiom(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,negated_conjecture,
~ theorem(implies(not(or(p,q)),not(p))),
file('/export/starexec/sandbox/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(or(p,q))),not(p))),
inference(definition_unfolding,[],[f9,f6]) ).
fof(f17,plain,
! [X0] : ~ axiom(or(not(or(X0,X0)),X0)),
inference(consistent_polarity_flipping,[],[f10]) ).
fof(f18,plain,
! [X0,X1] : ~ axiom(or(not(X0),or(X1,X0))),
inference(consistent_polarity_flipping,[],[f11]) ).
fof(f19,plain,
! [X0,X1] : ~ axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f20,plain,
! [X2,X0,X1] : ~ axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f21,plain,
! [X2,X0,X1] : ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f22,plain,
! [X0] :
( ~ theorem(X0)
| axiom(X0) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f23,plain,
! [X0,X1] :
( theorem(or(not(X1),X0))
| ~ theorem(X0)
| theorem(X1) ),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f24,plain,
theorem(or(not(not(or(p,q))),not(p))),
inference(consistent_polarity_flipping,[],[f16]) ).
fof(f26,plain,
! [X0,X1] :
( axiom(or(not(X1),X0))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f23,f22]) ).
fof(f27,plain,
! [X0] :
( theorem(or(X0,X0))
| ~ theorem(X0) ),
inference(resolution,[],[f26,f17]) ).
fof(f28,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[],[f26,f19]) ).
fof(f29,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(X0) ),
inference(resolution,[],[f26,f18]) ).
fof(f36,plain,
! [X0,X1] :
( ~ theorem(or(X0,X1))
| axiom(or(X1,X0)) ),
inference(resolution,[],[f28,f22]) ).
fof(f50,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,or(X0,X2))) ),
inference(resolution,[],[f20,f26]) ).
fof(f63,plain,
! [X2,X0,X1] :
( theorem(or(X0,X2))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f50,f29]) ).
fof(f72,plain,
! [X2,X0,X1] :
( axiom(or(X2,X0))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f63,f36]) ).
fof(f90,plain,
! [X2,X0,X1] : ~ theorem(or(or(X0,X1),or(X2,not(X1)))),
inference(resolution,[],[f72,f18]) ).
fof(f95,plain,
! [X2,X0,X1] : ~ theorem(or(X0,or(or(X1,X2),not(X2)))),
inference(resolution,[],[f90,f50]) ).
fof(f98,plain,
! [X2,X0,X1] :
( theorem(or(not(X0),X1))
| ~ theorem(or(not(or(X2,X0)),or(X2,X1))) ),
inference(resolution,[],[f21,f26]) ).
fof(f117,plain,
! [X0,X1] : ~ theorem(or(or(X0,X1),not(X1))),
inference(resolution,[],[f95,f27]) ).
fof(f121,plain,
! [X0,X1] : ~ theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f117,f28]) ).
fof(f123,plain,
! [X0,X1] : ~ theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f121,f50]) ).
fof(f128,plain,
! [X0] : ~ theorem(or(not(X0),X0)),
inference(resolution,[],[f123,f27]) ).
fof(f133,plain,
! [X0] : ~ theorem(or(X0,not(X0))),
inference(resolution,[],[f128,f28]) ).
fof(f159,plain,
! [X0,X1] : ~ theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))),
inference(resolution,[],[f98,f133]) ).
fof(f160,plain,
! [X2,X0,X1] :
( axiom(or(not(X1),X2))
| ~ theorem(or(not(or(X0,X1)),or(X0,X2))) ),
inference(resolution,[],[f98,f22]) ).
fof(f328,plain,
! [X2,X0,X1] : ~ theorem(or(not(or(X0,or(X1,X2))),or(X0,or(X2,X1)))),
inference(resolution,[],[f160,f19]) ).
fof(f1109,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f328,f23]) ).
fof(f1750,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X0,not(not(X1)))) ),
inference(resolution,[],[f159,f23]) ).
fof(f2830,plain,
! [X0,X1] : ~ theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f1109,f121]) ).
fof(f2866,plain,
! [X0,X1] : ~ theorem(or(not(X0),not(not(or(X0,X1))))),
inference(resolution,[],[f2830,f1750]) ).
fof(f3238,plain,
! [X0,X1] : ~ theorem(or(not(not(or(X0,X1))),not(X0))),
inference(resolution,[],[f2866,f28]) ).
fof(f3408,plain,
$false,
inference(resolution,[],[f3238,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL199-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 15:28:09 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.53 % (2511169)Will run a generic schedule for satisfiability detection.
% 0.17/0.53 % (2511176)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4240419096:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.53 % (2511175)% WARNING: option uhcvi not known.
% 0.17/0.53 % (2511175)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2678385783:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.53 % (2511174)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2683145401_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.53 % (2511177)dis+10_1_sil=32000:sp=arity:random_seed=3386944808:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.53 % (2511179)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2380752788:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.53 % (2511178)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1448267038:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.53 % (2511180)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=995490503:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.53 % TRYING [1]
% 0.17/0.53 % TRYING [2]
% 0.17/0.53 % TRYING [3]
% 0.17/0.53 % TRYING [4]
% 0.17/0.53 % (2511178)Instruction limit reached!
% 0.17/0.53 % (2511178)------------------------------
% 0.17/0.53 % (2511178)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.53 % (2511178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.53 % (2511178)CaDiCaL version: 2.1.3
% 0.17/0.53 % (2511178)Termination reason: Instruction limit
% 0.17/0.53 % (2511178)Termination phase: Saturation
% 0.17/0.53 % (2511178)Time elapsed: 0.054 s
% 0.17/0.53 % (2511178)Peak memory usage: 11 MB
% 0.17/0.53 % (2511178)Instructions burned: 117 (million)
% 0.17/0.53 % (2511177)Instruction limit reached!
% 0.17/0.53 % (2511177)------------------------------
% 0.17/0.53 % (2511177)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.53 % (2511177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.53 % (2511177)CaDiCaL version: 2.1.3
% 0.17/0.53 % (2511177)Termination reason: Instruction limit
% 0.17/0.53 % (2511177)Termination phase: Saturation
% 0.17/0.53 % (2511177)Time elapsed: 0.065 s
% 0.17/0.53 % (2511177)Peak memory usage: 12 MB
% 0.17/0.53 % (2511177)Instructions burned: 104 (million)
% 0.17/0.53 % (2511180) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2511169-2511180"...
% 0.17/0.53 % (2511180)...printing done.
% 0.17/0.53 % (2511180)Refutation found. Thanks to Tanya!
% 0.17/0.53 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.53 % (2511180)------------------------------
% 0.17/0.53 % (2511180)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.53 % (2511180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.53 % (2511180)CaDiCaL version: 2.1.3
% 0.17/0.53 % (2511180)Termination reason: Refutation
% 0.17/0.53 % (2511180)Time elapsed: 0.069 s
% 0.17/0.53 % (2511180)Peak memory usage: 13 MB
% 0.17/0.53 % (2511180)Instructions burned: 109 (million)
% 0.17/0.53 % (2511169)Success in time 0.112 s
% 0.17/0.53 % Vampire exiting
%------------------------------------------------------------------------------