%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL077-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:57:34 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.46s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 13 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 40 ( 40 !; 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,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_39) ).
fof(f6,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f1,f2]) ).
fof(f9,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),not(X2)),implies(X2,X1)))),
inference(resolution,[],[f6,f4]) ).
fof(f10,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(implies(X0,X1),implies(X0,X2))) ),
inference(resolution,[],[f3,f1]) ).
fof(f16,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(X0,X0))),
inference(resolution,[],[f10,f2]) ).
fof(f20,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(X0,X1)),implies(implies(X0,implies(X1,X2)),implies(X0,X2)))),
inference(resolution,[],[f10,f3]) ).
fof(f24,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),not(X2))),implies(X0,implies(X2,X1)))),
inference(resolution,[],[f9,f10]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X1)))
| is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X2))) ),
inference(resolution,[],[f20,f1]) ).
fof(f100,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
| is_a_theorem(implies(X0,implies(X2,X1))) ),
inference(resolution,[],[f24,f1]) ).
fof(f223,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(resolution,[],[f53,f16]) ).
fof(f228,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f223,f1]) ).
fof(f331,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f100,f2]) ).
fof(f343,plain,
! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
inference(resolution,[],[f331,f100]) ).
fof(f369,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(resolution,[],[f343,f228]) ).
fof(f386,plain,
$false,
inference(resolution,[],[f369,f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL077-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 15:21:17 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.42 Running first-order model finding
% 0.14/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.14/0.46 % (1083670)Will run a generic schedule for satisfiability detection.
% 0.14/0.46 % (1083680)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2727927053:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.14/0.46 % (1083680) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1083670-1083680"...
% 0.14/0.46 % (1083676)% WARNING: option uhcvi not known.
% 0.14/0.46 % (1083675)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4014517854_3000 on theBenchmark for (3000ds/0Mi)
% 0.14/0.46 % (1083680)...printing done.
% 0.14/0.46 % (1083680)Refutation found. Thanks to Tanya!
% 0.14/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.47 % (1083680)------------------------------
% 0.14/0.47 % (1083680)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.47 % (1083680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.47 % (1083680)CaDiCaL version: 2.1.3
% 0.14/0.47 % (1083680)Termination reason: Refutation
% 0.14/0.47 % (1083680)Time elapsed: 0.007 s
% 0.14/0.47 % (1083680)Peak memory usage: 11 MB
% 0.14/0.47 % (1083680)Instructions burned: 11 (million)
% 0.14/0.47 % (1083670)Success in time 0.031 s
% 0.14/0.47 % Vampire exiting
%------------------------------------------------------------------------------