%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL212-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 : n020.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:01 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 28 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 11 |; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
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(p),implies(q,implies(implies(p,q),q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,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(p)),or(not(q),or(not(or(not(p),q)),q)))),
inference(definition_unfolding,[],[f9,f6,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] : ~ axiom(or(not(X0),or(X1,X0))),
inference(consistent_polarity_flipping,[],[f11]) ).
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(p)),or(not(q),or(not(or(not(p),q)),q)))),
inference(consistent_polarity_flipping,[],[f16]) ).
fof(f26,plain,
! [X0,X1] :
( axiom(or(not(X1),X0))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f23,f22]) ).
fof(f29,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(X0) ),
inference(resolution,[],[f26,f18]) ).
fof(f31,plain,
theorem(or(not(q),or(not(or(not(p),q)),q))),
inference(resolution,[],[f29,f24]) ).
fof(f35,plain,
axiom(or(not(q),or(not(or(not(p),q)),q))),
inference(resolution,[],[f31,f22]) ).
fof(f39,plain,
$false,
inference(resolution,[],[f35,f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL212-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.12/0.38 % Computer : n020.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:27:34 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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.12/0.45 % (3535566)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (3535585)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1277452049:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.45 % (3535585) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3535566-3535585"...
% 0.12/0.45 % (3535585)...printing done.
% 0.12/0.45 % (3535585)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (3535585)------------------------------
% 0.12/0.45 % (3535585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (3535585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (3535585)CaDiCaL version: 2.1.3
% 0.12/0.45 % (3535585)Termination reason: Refutation
% 0.12/0.45 % (3535585)Time elapsed: 0.001 s
% 0.12/0.45 % (3535585)Peak memory usage: 11 MB
% 0.12/0.45 % (3535585)Instructions burned: 1 (million)
% 0.12/0.45 % (3535566)Success in time 0.032 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------