%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL239-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 : n001.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:09 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.44s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 24 unt; 1 def)
% Number of atoms : 51 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 14 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 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,negated_conjecture,
~ theorem(not(and(p,not(p)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f13,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f16,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f17,plain,
~ theorem(not(not(or(not(p),not(not(p)))))),
inference(definition_unfolding,[],[f10,f9]) ).
fof(f18,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f11,f7]) ).
fof(f19,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f20,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f13,f7]) ).
fof(f21,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f16,f18]) ).
fof(f23,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f14,f7]) ).
fof(f27,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f20,f16]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f23,f16]) ).
fof(f50,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f28,f19]) ).
fof(f61,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f50,f21]) ).
fof(f67,definition,
( spl0_4
<=> ! [X0] : theorem(or(not(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f68,plain,
( ! [X0] : theorem(or(not(X0),X0))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f95,plain,
spl0_4,
inference(avatar_split_clause,[],[f61,f67]) ).
fof(f101,plain,
( ! [X0] : theorem(or(X0,not(X0)))
| ~ spl0_4 ),
inference(resolution,[],[f68,f27]) ).
fof(f104,plain,
( ! [X0] :
( theorem(not(not(X0)))
| ~ theorem(X0) )
| ~ spl0_4 ),
inference(resolution,[],[f101,f16]) ).
fof(f109,plain,
( ~ theorem(or(not(p),not(not(p))))
| ~ spl0_4 ),
inference(resolution,[],[f104,f17]) ).
fof(f111,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f109,f101]) ).
fof(f112,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f111]) ).
cnf(s12,plain,
spl0_4,
inference(sat_conversion,[],[f95]) ).
cnf(s13,plain,
~ spl0_4,
inference(sat_conversion,[],[f112]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s12,s13]) ).
fof(f113,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL239-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.08/0.36 % Computer : n001.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 27 15:35:54 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 Running first-order model finding
% 0.12/0.39 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.12/0.44 % (3723405)Will run a generic schedule for satisfiability detection.
% 0.12/0.44 % (3723413)dis+10_1_sil=32000:sp=arity:random_seed=2043576015:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.44 % (3723413) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3723405-3723413"...
% 0.12/0.44 % (3723413)...printing done.
% 0.12/0.44 % (3723413)Refutation found. Thanks to Tanya!
% 0.12/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.44 % (3723413)------------------------------
% 0.12/0.44 % (3723413)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.44 % (3723413)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.44 % (3723413)CaDiCaL version: 2.1.3
% 0.12/0.44 % (3723413)Termination reason: Refutation
% 0.12/0.44 % (3723413)Time elapsed: 0.002 s
% 0.12/0.44 % (3723413)Peak memory usage: 12 MB
% 0.12/0.44 % (3723413)Instructions burned: 3 (million)
% 0.12/0.44 % (3723405)Success in time 0.033 s
% 0.12/0.44 % Vampire exiting
%------------------------------------------------------------------------------