%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL542+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 : 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:54 AM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 15 unt; 0 def)
% Number of atoms : 53 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 17 ~; 12 |; 0 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 29 !; 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(f40,axiom,
and_1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_1) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',necessitation) ).
fof(f64,axiom,
( axiom_m2
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_m2) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+3.ax',km4b_necessitation) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f89,conjecture,
axiom_m2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f90,negated_conjecture,
~ axiom_m2,
inference(negated_conjecture,[status(cth)],[f89]) ).
fof(f91,plain,
~ axiom_m2,
inference(flattening,[],[f90]) ).
fof(f92,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0))
=> axiom_m2 ),
inference(unused_predicate_definition_removal,[],[f64]) ).
fof(f97,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f106,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f124,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(ennf_transformation,[],[f106]) ).
fof(f136,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f97]) ).
fof(f141,plain,
( axiom_m2
| ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f92]) ).
fof(f143,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f151,plain,
! [X0,X1] :
( ~ and_1
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f171,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f181,plain,
! [X0] :
( ~ necessitation
| ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(cnf_transformation,[],[f136]) ).
fof(f186,plain,
( ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0))
| axiom_m2 ),
inference(cnf_transformation,[],[f141]) ).
fof(f188,plain,
! [X0,X1] :
( ~ op_strict_implies
| strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(cnf_transformation,[],[f143]) ).
fof(f191,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f198,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f201,plain,
~ axiom_m2,
inference(cnf_transformation,[],[f91]) ).
fof(f203,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f188,f198]) ).
fof(f205,plain,
~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)),
inference(forward_subsumption_resolution,[],[f186,f201]) ).
fof(f210,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f181,f191]) ).
fof(f222,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f151,f171]) ).
fof(f233,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f210,f203]) ).
fof(f328,plain,
~ is_a_theorem(implies(and(sK0,sK1),sK0)),
inference(resolution,[],[f233,f205]) ).
fof(f329,plain,
$false,
inference(forward_subsumption_resolution,[],[f328,f222]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL542+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.39 % Computer : n001.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 16:05:02 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.46 % (3750184)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (3750193)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1773901049:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (3750193) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3750184-3750193"...
% 0.11/0.46 % (3750190)% WARNING: option uhcvi not known.
% 0.11/0.46 % (3750193)...printing done.
% 0.11/0.46 % (3750193)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (3750193)------------------------------
% 0.11/0.46 % (3750193)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (3750193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (3750193)CaDiCaL version: 2.1.3
% 0.11/0.46 % (3750193)Termination reason: Refutation
% 0.11/0.46 % (3750193)Time elapsed: 0.003 s
% 0.11/0.46 % (3750193)Peak memory usage: 12 MB
% 0.11/0.46 % (3750193)Instructions burned: 7 (million)
% 0.11/0.46 % (3750184)Success in time 0.031 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------