%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:47 AM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 37 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 11 ~; 7 |; 0 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 24 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(f45,conjecture,
implies_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_1) ).
fof(f46,negated_conjecture,
~ implies_1,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ implies_1,
inference(flattening,[],[f46]) ).
fof(f51,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f53,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
=> implies_1 ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f59,plain,
( implies_1
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f61,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f51]) ).
fof(f68,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f70,plain,
( implies_1
| ~ is_a_theorem(implies(sK0,implies(sK1,sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f59]) ).
fof(f73,plain,
( implies_1
| ~ is_a_theorem(implies(sK0,implies(sK1,sK0))) ),
inference(cnf_transformation,[],[f70]) ).
fof(f75,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[],[f61]) ).
fof(f82,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f68]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f97,plain,
~ implies_1,
inference(cnf_transformation,[],[f47]) ).
fof(f99,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f82,f84]) ).
fof(f106,plain,
! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))),
inference(forward_subsumption_resolution,[],[f75,f89]) ).
fof(f108,plain,
~ is_a_theorem(implies(sK0,implies(sK1,sK0))),
inference(forward_subsumption_resolution,[],[f73,f97]) ).
fof(f113,plain,
! [X0,X1] : is_a_theorem(implies(X1,implies(X0,X1))),
inference(superposition,[],[f106,f99]) ).
fof(f115,plain,
$false,
inference(resolution,[],[f113,f108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n026.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 15:52:56 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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.18/0.47 % (3026270)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (3026275)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1322901296_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % TRYING [1]
% 0.18/0.47 % TRYING [2]
% 0.18/0.47 % TRYING [3]
% 0.18/0.47 % (3026276)% WARNING: option uhcvi not known.
% 0.18/0.47 % TRYING [4]
% 0.18/0.47 % (3026276)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4274568987:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (3026277)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=931636183:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (3026278)dis+10_1_sil=32000:sp=arity:random_seed=296645228:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (3026280)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=977045704:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.47 % (3026279)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=782408845:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (3026281)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3594355539:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.47 % (3026280) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3026270-3026280"...
% 0.18/0.47 % (3026279) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3026270-3026279"...
% 0.18/0.47 % (3026276) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3026270-3026276"...
% 0.18/0.47 % (3026278) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3026270-3026278"...
% 0.18/0.47 % (3026277) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3026270-3026277"...
% 0.18/0.47 % (3026281) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3026270-3026281"...
% 0.18/0.47 % (3026280)...printing done.
% 0.18/0.47 % (3026279)...printing done.
% 0.18/0.47 % (3026276)...printing done.
% 0.18/0.47 % (3026278)...printing done.
% 0.18/0.47 % (3026277)...printing done.
% 0.18/0.47 % (3026280)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (3026280)------------------------------
% 0.18/0.47 % (3026280)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (3026280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (3026280)CaDiCaL version: 2.1.3
% 0.18/0.47 % (3026280)Termination reason: Refutation
% 0.18/0.47 % (3026280)Time elapsed: 0.002 s
% 0.18/0.47 % (3026280)Peak memory usage: 12 MB
% 0.18/0.47 % (3026280)Instructions burned: 2 (million)
% 0.18/0.47 % (3026270)Success in time 0.038 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------