%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL460+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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:44 AM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 14 unt; 4 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 22 ~; 19 |; 0 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_1) ).
fof(f53,conjecture,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f54,negated_conjecture,
~ kn2,
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f55,plain,
~ kn2,
inference(flattening,[],[f54]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
=> kn2 ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f65,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f81,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(ennf_transformation,[],[f65]) ).
fof(f90,plain,
( kn2
| ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f56]) ).
fof(f94,plain,
( kn2
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f90]) ).
fof(f101,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f81]) ).
fof(f110,plain,
( kn2
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(cnf_transformation,[],[f94]) ).
fof(f122,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f135,plain,
~ kn2,
inference(cnf_transformation,[],[f55]) ).
fof(f186,definition,
( spl2_7
<=> is_a_theorem(implies(and(sK0,sK1),sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
fof(f188,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK0))
| spl2_7 ),
inference(avatar_component_clause,[],[f186]) ).
fof(f190,definition,
( spl2_8
<=> kn2 ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
fof(f192,plain,
( kn2
| ~ spl2_8 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f193,plain,
( ~ spl2_7
| spl2_8 ),
inference(avatar_split_clause,[],[f110,f190,f186]) ).
fof(f259,definition,
( spl2_25
<=> and_1 ),
introduced(definition,[new_symbols(definition,[spl2_25])],[avatar_definition]) ).
fof(f261,plain,
( ~ and_1
| spl2_25 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f263,definition,
( spl2_26
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(definition,[new_symbols(definition,[spl2_26])],[avatar_definition]) ).
fof(f264,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl2_26 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f265,plain,
( ~ spl2_25
| spl2_26 ),
inference(avatar_split_clause,[],[f101,f263,f259]) ).
fof(f334,plain,
( $false
| spl2_25 ),
inference(resolution,[],[f261,f122]) ).
fof(f335,plain,
spl2_25,
inference(avatar_contradiction_clause,[],[f334]) ).
fof(f348,plain,
( $false
| spl2_7
| ~ spl2_26 ),
inference(resolution,[],[f264,f188]) ).
fof(f349,plain,
( spl2_7
| ~ spl2_26 ),
inference(avatar_contradiction_clause,[],[f348]) ).
fof(f350,plain,
( $false
| ~ spl2_8 ),
inference(resolution,[],[f192,f135]) ).
fof(f351,plain,
~ spl2_8,
inference(avatar_contradiction_clause,[],[f350]) ).
cnf(s4,plain,
( ~ spl2_7
| spl2_8 ),
inference(sat_conversion,[],[f193]) ).
cnf(s13,plain,
( ~ spl2_25
| spl2_26 ),
inference(sat_conversion,[],[f265]) ).
cnf(s30,plain,
spl2_25,
inference(sat_conversion,[],[f335]) ).
cnf(s37,plain,
( spl2_7
| ~ spl2_26 ),
inference(sat_conversion,[],[f349]) ).
cnf(s38,plain,
~ spl2_8,
inference(sat_conversion,[],[f351]) ).
cnf(s45,plain,
spl2_26,
inference(rat,[],[s13,s30]) ).
cnf(s46,plain,
spl2_7,
inference(rat,[],[s37,s45]) ).
cnf(s55,plain,
$false,
inference(rat,[],[s4,s38,s46]) ).
fof(f352,plain,
$false,
inference(avatar_sat_refutation,[],[s55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL460+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 15:47:41 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/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.11/0.45 % (735482)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (735493)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3572077943:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (735493) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-735482-735493"...
% 0.11/0.45 % (735493)...printing done.
% 0.11/0.45 % (735493)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (735493)------------------------------
% 0.11/0.45 % (735493)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (735493)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (735493)CaDiCaL version: 2.1.3
% 0.11/0.45 % (735493)Termination reason: Refutation
% 0.11/0.45 % (735493)Time elapsed: 0.002 s
% 0.11/0.45 % (735493)Peak memory usage: 12 MB
% 0.11/0.45 % (735493)Instructions burned: 3 (million)
% 0.11/0.45 % (735482)Success in time 0.032 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------