%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL399-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:33 AM UTC 2026
% Result : Unsatisfiable 0.84s 0.61s
% Output : Refutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 21 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 50 ( 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',cn_1) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),not(implies(y,y))),x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_65) ).
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(f22,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f18,f4]) ).
fof(f26,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f19,f4]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f22,f1]) ).
fof(f49,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f30,f4]) ).
fof(f54,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,implies(X0,X3))))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(resolution,[],[f21,f2]) ).
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(f81,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f58,f19]) ).
fof(f113,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f81,f49]) ).
fof(f178,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(implies(X0,X1)),implies(X2,X1)))
| is_a_theorem(implies(implies(X0,X2),implies(X0,X1))) ),
inference(resolution,[],[f54,f19]) ).
fof(f1387,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,not(X1)),implies(X0,X2)))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f178,f113]) ).
fof(f1401,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X1),not(X0)),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1387,f19]) ).
fof(f1434,plain,
~ is_a_theorem(implies(y,y)),
inference(resolution,[],[f1401,f5]) ).
fof(f1462,plain,
$false,
inference(forward_subsumption_resolution,[],[f1434,f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL399-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.45 % Computer : n020.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Sun Sep 27 15:41:04 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/0.61 % (3555950)Will run a generic schedule for satisfiability detection.
% 0.84/0.61 % (3555955)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=458585780_2999 on theBenchmark for (2999ds/0Mi)
% 0.84/0.61 % TRYING [1]
% 0.84/0.61 % TRYING [2]
% 0.84/0.61 % TRYING [3]
% 0.84/0.61 % TRYING [4]
% 0.84/0.61 % (3555956)% WARNING: option uhcvi not known.
% 0.84/0.61 % (3555958)dis+10_1_sil=32000:sp=arity:random_seed=3734588364:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.84/0.61 % (3555960)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=204711699:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.84/0.61 % (3555961)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1634351838:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.84/0.61 % (3555959)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=521339450:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.84/0.61 % (3555956)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1056591632:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.84/0.61 % (3555957)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3960489531:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.84/0.61 % TRYING [5]
% 0.84/0.61 % (3555958) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3555950-3555958"...
% 0.84/0.61 % (3555958)...printing done.
% 0.84/0.61 % (3555958)Refutation found. Thanks to Tanya!
% 0.84/0.61 % SZS status Unsatisfiable for theBenchmark
% 0.84/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 0.84/0.61 % (3555958)------------------------------
% 0.84/0.61 % (3555958)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.61 % (3555958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.61 % (3555958)CaDiCaL version: 2.1.3
% 0.84/0.61 % (3555958)Termination reason: Refutation
% 0.84/0.61 % (3555958)Time elapsed: 0.046 s
% 0.84/0.61 % (3555958)Peak memory usage: 11 MB
% 0.84/0.61 % (3555958)Instructions burned: 47 (million)
% 0.84/0.61 % (3555950)Success in time 0.095 s
% 0.84/0.61 % Vampire exiting
%------------------------------------------------------------------------------