%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL363-1 : 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 : n004.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:26 AM UTC 2026
% Result : Unsatisfiable 0.26s 0.60s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(not(y),y),y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_12) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f4]) ).
fof(f8,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f2,f1]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f8,f1]) ).
fof(f19,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f18,f3]) ).
fof(f21,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(resolution,[],[f18,f8]) ).
fof(f58,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X1,not(X0))) ),
inference(resolution,[],[f21,f4]) ).
fof(f82,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f58,f19]) ).
fof(f126,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f82,f7]) ).
fof(f150,plain,
~ is_a_theorem(implies(implies(not(y),y),y)),
inference(resolution,[],[f126,f5]) ).
fof(f151,plain,
$false,
inference(forward_subsumption_resolution,[],[f150,f3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL363-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.21/0.48 % Computer : n004.cluster.edu
% 0.21/0.48 % Model : x86_64 x86_64
% 0.21/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.48 % Memory : 8046.5625MB
% 0.21/0.48 % OS : Linux 6.8.0-71-generic
% 0.21/0.49 % CPULimit : 300
% 0.21/0.49 % WCLimit : 300
% 0.21/0.49 % DateTime : Sun Sep 27 15:36:07 UTC 2026
% 0.21/0.49 % CPUTime :
% 0.21/0.49 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.54 Running first-order model finding
% 0.26/0.54 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.26/0.60 % (3679987)Will run a generic schedule for satisfiability detection.
% 0.26/0.60 % (3679995)dis+10_1_sil=32000:sp=arity:random_seed=2457312626:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.26/0.60 % (3679995) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3679987-3679995"...
% 0.26/0.60 % (3679995)...printing done.
% 0.26/0.60 % (3679993)% WARNING: option uhcvi not known.
% 0.26/0.60 % (3679995)Refutation found. Thanks to Tanya!
% 0.26/0.60 % SZS status Unsatisfiable for theBenchmark
% 0.26/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.60 % (3679995)------------------------------
% 0.26/0.60 % (3679995)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.60 % (3679995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.60 % (3679995)CaDiCaL version: 2.1.3
% 0.29/0.60 % (3679995)Termination reason: Refutation
% 0.29/0.60 % (3679995)Time elapsed: 0.003 s
% 0.29/0.60 % (3679995)Peak memory usage: 11 MB
% 0.29/0.60 % (3679995)Instructions burned: 4 (million)
% 0.29/0.60 % (3679987)Success in time 0.041 s
% 0.29/0.60 % Vampire exiting
%------------------------------------------------------------------------------