%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL065-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 : n003.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:32 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.57s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 21 unt; 1 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 92 ( 58 ~; 33 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn 97 !; 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,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',cn_49) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_2) ).
fof(f6,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f7,plain,
! [X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,X0))),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f8,plain,
! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f9,plain,
! [X0,X1] : ~ is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f10,plain,
is_a_theorem(implies(implies(not(a),a),a)),
inference(consistent_polarity_flipping,[],[f5]) ).
fof(f11,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f6,f7]) ).
fof(f16,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(implies(X0,X1),implies(X0,X2))) ),
inference(resolution,[],[f8,f6]) ).
fof(f17,plain,
! [X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(X0,X0))),
inference(resolution,[],[f16,f7]) ).
fof(f18,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X0,X1),implies(X0,X2))) ),
inference(resolution,[],[f16,f11]) ).
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,[],[f16,f8]) ).
fof(f22,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,X0)) ),
inference(resolution,[],[f17,f6]) ).
fof(f23,plain,
! [X0] : ~ is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f22,f7]) ).
fof(f32,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(implies(X0,X0)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f33,plain,
( ! [X0] : ~ is_a_theorem(implies(X0,X0))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f35,plain,
spl0_2,
inference(avatar_split_clause,[],[f23,f32]) ).
fof(f37,plain,
( ! [X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,X1),X0),implies(implies(X0,X1),X1)))
| ~ spl0_2 ),
inference(resolution,[],[f33,f16]) ).
fof(f39,plain,
! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(X0,implies(X2,X1)))),
inference(resolution,[],[f18,f7]) ).
fof(f42,plain,
! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,implies(not(X1),not(X2))),implies(X0,implies(X2,X1)))),
inference(resolution,[],[f18,f9]) ).
fof(f47,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(X2,X1))) ),
inference(resolution,[],[f39,f6]) ).
fof(f56,plain,
! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(X2,implies(X0,X0)))),
inference(resolution,[],[f47,f17]) ).
fof(f57,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(X2,implies(X0,implies(X3,X1))))),
inference(resolution,[],[f47,f39]) ).
fof(f74,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,implies(X0,X0))) ),
inference(resolution,[],[f56,f6]) ).
fof(f93,plain,
( ! [X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,X1)))
| ~ spl0_2 ),
inference(resolution,[],[f74,f33]) ).
fof(f103,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X2))))
| ~ spl0_2 ),
inference(resolution,[],[f93,f47]) ).
fof(f121,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,implies(X0,implies(X3,X1)))) ),
inference(resolution,[],[f57,f6]) ).
fof(f149,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
| ~ spl0_2 ),
inference(resolution,[],[f121,f33]) ).
fof(f230,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X0))
| ~ is_a_theorem(implies(implies(X0,X1),X1)) )
| ~ spl0_2 ),
inference(resolution,[],[f37,f6]) ).
fof(f233,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,implies(X1,X0)),X2),X2))
| ~ spl0_2 ),
inference(resolution,[],[f230,f149]) ).
fof(f234,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,implies(X1,X1)),X2),X2))
| ~ spl0_2 ),
inference(resolution,[],[f230,f103]) ).
fof(f300,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),not(X2))))
| ~ is_a_theorem(implies(X0,implies(X2,X1))) ),
inference(resolution,[],[f42,f6]) ).
fof(f307,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| ~ is_a_theorem(X2) )
| ~ spl0_2 ),
inference(resolution,[],[f233,f6]) ).
fof(f359,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X1,X1)),X2))
| ~ is_a_theorem(X2) )
| ~ spl0_2 ),
inference(resolution,[],[f234,f6]) ).
fof(f371,plain,
( ! [X0,X1] : ~ is_a_theorem(implies(not(X0),implies(X0,X1)))
| ~ spl0_2 ),
inference(resolution,[],[f307,f42]) ).
fof(f402,plain,
( ! [X0,X1] : ~ is_a_theorem(implies(implies(not(X0),X0),implies(not(X0),X1)))
| ~ spl0_2 ),
inference(resolution,[],[f371,f16]) ).
fof(f1063,plain,
( ! [X0,X1] : ~ is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ spl0_2 ),
inference(resolution,[],[f20,f359]) ).
fof(f1081,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X0,implies(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl0_2 ),
inference(resolution,[],[f1063,f6]) ).
fof(f4100,plain,
( ! [X0,X1] : ~ is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0)))
| ~ spl0_2 ),
inference(resolution,[],[f300,f402]) ).
fof(f4133,plain,
( ! [X0] : ~ is_a_theorem(implies(implies(not(X0),X0),X0))
| ~ spl0_2 ),
inference(resolution,[],[f4100,f1081]) ).
fof(f4144,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f4133,f10]) ).
fof(f4162,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f4144]) ).
cnf(s2,plain,
spl0_2,
inference(sat_conversion,[],[f35]) ).
cnf(s42,plain,
~ spl0_2,
inference(sat_conversion,[],[f4162]) ).
cnf(s43,plain,
$false,
inference(rat,[],[s2,s42]) ).
fof(f4163,plain,
$false,
inference(avatar_sat_refutation,[],[s43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL065-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n003.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:21:56 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.44 Running first-order model finding
% 0.14/0.44 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.17/0.57 % (691386)Will run a generic schedule for satisfiability detection.
% 0.17/0.57 % (691397)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1631434764:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.57 % (691392)% WARNING: option uhcvi not known.
% 0.17/0.57 % (691392)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3248463256:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.57 % (691395)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1752238872:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.57 % (691393)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3841008760:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.57 % (691394)dis+10_1_sil=32000:sp=arity:random_seed=348347927:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.57 % (691396)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4224604133:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.57 % (691391)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3289203355_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.57 % TRYING [1]
% 0.17/0.57 % TRYING [2]
% 0.17/0.57 % TRYING [3]
% 0.17/0.57 % TRYING [4]
% 0.17/0.57 % TRYING [5]
% 0.17/0.57 % (691397) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-691386-691397"...
% 0.17/0.57 % (691397)...printing done.
% 0.17/0.57 % (691397)Refutation found. Thanks to Tanya!
% 0.17/0.57 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.57 % (691397)------------------------------
% 0.17/0.57 % (691397)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.57 % (691397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.57 % (691397)CaDiCaL version: 2.1.3
% 0.17/0.57 % (691397)Termination reason: Refutation
% 0.17/0.57 % (691397)Time elapsed: 0.081 s
% 0.17/0.57 % (691397)Peak memory usage: 14 MB
% 0.17/0.57 % (691397)Instructions burned: 146 (million)
% 0.17/0.57 % (691386)Success in time 0.122 s
% 0.17/0.57 % Vampire exiting
%------------------------------------------------------------------------------