%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL029-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:27 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.49s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 16 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 49 !; 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',c0_1) ).
fof(f3,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_3) ).
fof(f5,axiom,
! [X0] : is_a_theorem(implies(falsehood,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_4) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_5) ).
fof(f8,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f3]) ).
fof(f17,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f4,f1]) ).
fof(f20,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(f22,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f20,f17]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f20,f1]) ).
fof(f30,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,falsehood))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f23,f5]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(X1,X2),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f23,f4]) ).
fof(f36,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,[],[f23,f20]) ).
fof(f40,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(falsehood,X0),falsehood),X1)),
inference(resolution,[],[f30,f4]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f34,f8]) ).
fof(f135,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,[],[f36,f2]) ).
fof(f143,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(falsehood,X1))),
inference(resolution,[],[f89,f40]) ).
fof(f401,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),implies(X1,X2)))
| is_a_theorem(implies(implies(X0,X1),implies(X0,X2))) ),
inference(resolution,[],[f135,f22]) ).
fof(f3580,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,falsehood),implies(X0,X1))),
inference(resolution,[],[f401,f143]) ).
fof(f3595,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),falsehood),X0)),
inference(resolution,[],[f3580,f34]) ).
fof(f3698,plain,
$false,
inference(resolution,[],[f3595,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL029-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n019.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 15:18:19 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.15/0.49 % (3190099)Will run a generic schedule for satisfiability detection.
% 0.15/0.49 % (3190107)dis+10_1_sil=32000:sp=arity:random_seed=1037777885:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.49 % (3190105)% WARNING: option uhcvi not known.
% 0.15/0.49 % (3190104)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2181650496_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.49 % (3190105)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1122638027:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.49 % (3190106)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1673515813:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.49 % (3190108)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1655615801:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.49 % (3190110)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3308250006:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.49 % (3190109)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1744483207:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.49 % TRYING [1]
% 0.15/0.49 % TRYING [2]
% 0.15/0.49 % TRYING [3]
% 0.15/0.49 % TRYING [4]
% 0.15/0.49 % TRYING [5]
% 0.15/0.49 % (3190107) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3190099-3190107"...
% 0.15/0.49 % (3190107)...printing done.
% 0.15/0.49 % (3190107)Refutation found. Thanks to Tanya!
% 0.15/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.49 % (3190107)------------------------------
% 0.15/0.49 % (3190107)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.49 % (3190107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.49 % (3190107)CaDiCaL version: 2.1.3
% 0.15/0.49 % (3190107)Termination reason: Refutation
% 0.15/0.49 % (3190107)Time elapsed: 0.035 s
% 0.15/0.49 % (3190107)Peak memory usage: 12 MB
% 0.15/0.49 % (3190107)Instructions burned: 103 (million)
% 0.15/0.49 % (3190099)Success in time 0.063 s
% 0.15/0.49 % Vampire exiting
%------------------------------------------------------------------------------