%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL272-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 : 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:58:15 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 21 unt; 0 def)
% Number of atoms : 41 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 7 ( 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 : 48 ( 48 !; 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(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,or(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(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),or(p,p))),not(or(not(or(p,p)),p))))),
inference(definition_unfolding,[],[f11,f12]) ).
fof(f30,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f31,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f32,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f108,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f108,f18]) ).
fof(f117,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f109,f32]) ).
fof(f170,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f117,f18]) ).
fof(f194,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f170,f18]) ).
fof(f247,plain,
! [X0,X1] :
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f194,f170]) ).
fof(f689,plain,
( ~ theorem(or(not(p),or(p,p)))
| ~ theorem(or(not(or(p,p)),p)) ),
inference(resolution,[],[f247,f19]) ).
fof(f691,plain,
~ theorem(or(not(or(p,p)),p)),
inference(forward_subsumption_resolution,[],[f689,f31]) ).
fof(f692,plain,
$false,
inference(forward_subsumption_resolution,[],[f691,f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL272-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:31:40 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.46 % (3107416)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (3107425)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3300975283:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46 % (3107422)% WARNING: option uhcvi not known.
% 0.10/0.46 % (3107421)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=97964374_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.46 % (3107423)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=966102098:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.46 % (3107424)dis+10_1_sil=32000:sp=arity:random_seed=2583188210:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.46 % (3107426)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3231209747:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.46 % (3107427)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1054489986:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.46 % TRYING [1]
% 0.10/0.46 % TRYING [2]
% 0.10/0.46 % (3107422)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4129180861:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46 % TRYING [3]
% 0.10/0.46 % TRYING [4]
% 0.10/0.46 % (3107423) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3107416-3107423"...
% 0.10/0.46 % (3107423)...printing done.
% 0.10/0.46 % (3107423)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (3107423)------------------------------
% 0.10/0.46 % (3107423)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (3107423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (3107423)CaDiCaL version: 2.1.3
% 0.10/0.46 % (3107423)Termination reason: Refutation
% 0.10/0.46 % (3107423)Time elapsed: 0.013 s
% 0.10/0.46 % (3107423)Peak memory usage: 11 MB
% 0.10/0.46 % (3107423)Instructions burned: 17 (million)
% 0.10/0.46 % (3107416)Success in time 0.048 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------