%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL271-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 : n008.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:15 AM UTC 2026
% Result : Unsatisfiable 0.95s 0.88s
% Output : Refutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 36 unt; 0 def)
% Number of atoms : 84 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 32 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 109 ( 109 !; 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] :
( ~ axiom(X0)
| theorem(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,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(p,and(p,p))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,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(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(p),not(or(not(p),not(p))))),not(or(not(not(or(not(p),not(p)))),p))))),
inference(definition_unfolding,[],[f11,f12,f9]) ).
fof(f20,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f7,f13]) ).
fof(f21,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f7,f14]) ).
fof(f22,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f23,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f24,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f18,f20]) ).
fof(f25,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f18,f21]) ).
fof(f26,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f29,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f22,f18]) ).
fof(f30,plain,
! [X0] : theorem(or(X0,not(or(X0,X0)))),
inference(resolution,[],[f29,f20]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f23,f18]) ).
fof(f73,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f70,f25]) ).
fof(f74,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f70,f21]) ).
fof(f75,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f70,f22]) ).
fof(f79,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f74,f24]) ).
fof(f114,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f29,f79]) ).
fof(f138,plain,
! [X0,X1] : theorem(or(or(not(or(X0,X1)),X0),X1)),
inference(resolution,[],[f75,f29]) ).
fof(f139,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f75,f18]) ).
fof(f146,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f73,f18]) ).
fof(f147,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f139,f18]) ).
fof(f154,plain,
! [X0,X1] :
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f147,f139]) ).
fof(f188,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X2,X1)) ),
inference(resolution,[],[f146,f22]) ).
fof(f263,plain,
( ~ theorem(or(not(p),not(or(not(p),not(p)))))
| ~ theorem(or(not(not(or(not(p),not(p)))),p)) ),
inference(resolution,[],[f154,f19]) ).
fof(f265,plain,
~ theorem(or(not(not(or(not(p),not(p)))),p)),
inference(forward_subsumption_resolution,[],[f263,f30]) ).
fof(f294,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f70,f188]) ).
fof(f309,plain,
! [X2,X0,X1] : theorem(or(X0,or(or(not(or(X1,or(X0,X2))),X1),X2))),
inference(resolution,[],[f70,f138]) ).
fof(f339,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X1,X0)) ),
inference(resolution,[],[f294,f24]) ).
fof(f366,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f26,f18]) ).
fof(f1839,plain,
! [X0,X1] : theorem(or(or(not(or(X0,or(X1,X1))),X0),X1)),
inference(resolution,[],[f309,f339]) ).
fof(f1846,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,or(X0,X0))),X1))),
inference(resolution,[],[f1839,f29]) ).
fof(f1884,plain,
! [X0,X1] : theorem(or(not(or(X0,or(X1,X1))),or(X1,X0))),
inference(resolution,[],[f1846,f70]) ).
fof(f1911,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,or(X1,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f1884,f146]) ).
fof(f2093,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f366,f18]) ).
fof(f2414,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
inference(resolution,[],[f1911,f21]) ).
fof(f2477,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X0)))),
inference(resolution,[],[f2414,f70]) ).
fof(f2600,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f2093,f114]) ).
fof(f2912,plain,
! [X0,X1] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f2600,f29]) ).
fof(f3016,plain,
~ theorem(or(p,or(not(p),not(p)))),
inference(resolution,[],[f2912,f265]) ).
fof(f3042,plain,
$false,
inference(forward_subsumption_resolution,[],[f3016,f2477]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL271-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.23/0.49 % Computer : n008.cluster.edu
% 0.23/0.49 % Model : x86_64 x86_64
% 0.23/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.49 % Memory : 8046.5625MB
% 0.23/0.49 % OS : Linux 6.8.0-71-generic
% 0.23/0.49 % CPULimit : 300
% 0.23/0.49 % WCLimit : 300
% 0.23/0.49 % DateTime : Sun Sep 27 15:32:39 UTC 2026
% 0.09/0.49 % CPUTime :
% 0.09/0.49 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.54 Running first-order model finding
% 0.09/0.55 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.95/0.88 % (1389050)Will run a generic schedule for satisfiability detection.
% 0.95/0.88 % (1389056)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2885739790_2999 on theBenchmark for (2999ds/0Mi)
% 0.95/0.88 % TRYING [1]
% 0.95/0.88 % TRYING [2]
% 0.95/0.88 % TRYING [3]
% 0.95/0.88 % (1389057)% WARNING: option uhcvi not known.
% 0.95/0.88 % TRYING [4]
% 0.95/0.88 % (1389057)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2613156435:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.95/0.88 % (1389060)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2582297834:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.95/0.88 % (1389059)dis+10_1_sil=32000:sp=arity:random_seed=3651254199:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.95/0.88 % (1389058)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2914127152:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.95/0.88 % (1389061)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1648273583:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.95/0.88 % (1389062)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1872368638:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.95/0.88 % TRYING [5]
% 0.95/0.88 % (1389060)Instruction limit reached!
% 0.95/0.88 % (1389060)------------------------------
% 0.95/0.88 % (1389060)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.88 % (1389060)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.88 % (1389060)CaDiCaL version: 2.1.3
% 0.95/0.88 % (1389060)Termination reason: Instruction limit
% 0.95/0.88 % (1389060)Termination phase: Saturation
% 0.95/0.88 % (1389060)Time elapsed: 0.091 s
% 0.95/0.88 % (1389060)Peak memory usage: 11 MB
% 0.95/0.88 % (1389060)Instructions burned: 116 (million)
% 0.95/0.88 % (1389059)Instruction limit reached!
% 0.95/0.88 % (1389059)------------------------------
% 0.95/0.88 % (1389059)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.88 % (1389059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.88 % (1389059)CaDiCaL version: 2.1.3
% 0.95/0.88 % (1389059)Termination reason: Instruction limit
% 0.95/0.88 % (1389059)Termination phase: Saturation
% 0.95/0.88 % (1389059)Time elapsed: 0.106 s
% 0.95/0.88 % (1389059)Peak memory usage: 11 MB
% 0.95/0.88 % (1389059)Instructions burned: 103 (million)
% 0.95/0.88 % (1389070)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3451483364:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 0.95/0.88 % (1389061)Instruction limit reached!
% 0.95/0.88 % (1389061)------------------------------
% 0.95/0.88 % (1389061)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.88 % (1389061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.88 % (1389061)CaDiCaL version: 2.1.3
% 0.95/0.88 % (1389061)Termination reason: Instruction limit
% 0.95/0.88 % (1389061)Termination phase: Saturation
% 0.95/0.88 % (1389061)Time elapsed: 0.140 s
% 0.95/0.88 % (1389061)Peak memory usage: 13 MB
% 0.95/0.88 % (1389061)Instructions burned: 132 (million)
% 0.95/0.88 % TRYING [1]
% 0.95/0.88 % TRYING [2]
% 0.95/0.88 % TRYING [3]
% 0.95/0.88 % (1389071)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=175710976:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.95/0.88 % (1389062)Instruction limit reached!
% 0.95/0.88 % (1389062)------------------------------
% 0.95/0.88 % (1389062)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.88 % (1389062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.88 % (1389062)CaDiCaL version: 2.1.3
% 0.95/0.88 % (1389062)Termination reason: Instruction limit
% 0.95/0.88 % (1389062)Termination phase: Saturation
% 0.95/0.88 % (1389062)Time elapsed: 0.154 s
% 0.95/0.88 % (1389062)Peak memory usage: 13 MB
% 0.95/0.88 % (1389062)Instructions burned: 159 (million)
% 0.95/0.88 % TRYING [4]
% 0.95/0.88 % (1389073)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1569707188:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.95/0.88 % (1389075)ott-21_1_sil=16000:fs=off:random_seed=3547659612:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 0.95/0.88 % (1389073) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1389050-1389073"...
% 0.95/0.88 % (1389073)...printing done.
% 0.95/0.88 % (1389073)Refutation found. Thanks to Tanya!
% 0.95/0.88 % SZS status Unsatisfiable for theBenchmark
% 0.95/0.88 % SZS output start Proof for theBenchmark
% See solution above
% 0.95/0.88 % (1389073)------------------------------
% 0.95/0.88 % (1389073)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.88 % (1389073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.88 % (1389073)CaDiCaL version: 2.1.3
% 0.95/0.88 % (1389073)Termination reason: Refutation
% 0.95/0.88 % (1389073)Time elapsed: 0.076 s
% 0.95/0.88 % (1389073)Peak memory usage: 12 MB
% 0.95/0.88 % (1389073)Instructions burned: 80 (million)
% 0.95/0.88 % (1389050)Success in time 0.321 s
% 0.95/0.88 % Vampire exiting
%------------------------------------------------------------------------------