%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL066-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:51:05 AM UTC 2026
% Result : Unsatisfiable 4.25s 2.04s
% Output : Refutation 4.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 13 unt; 2 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 31 ~; 25 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 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/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(a,implies(not(a),b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_3) ).
fof(f6,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f2]) ).
fof(f7,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f4,f1]) ).
fof(f10,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f3,f1]) ).
fof(f13,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f10,f1]) ).
fof(f26,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),not(X1)),X1))
| is_a_theorem(implies(implies(not(X0),not(X1)),X0)) ),
inference(resolution,[],[f13,f4]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f13,f6]) ).
fof(f38,definition,
( spl0_3
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f39,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f45,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f30,f2]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X2),not(X1))))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f30,f4]) ).
fof(f56,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),implies(not(implies(not(X0),X1)),X1)))
| is_a_theorem(implies(implies(not(X0),not(implies(not(X0),X1))),X0)) ),
inference(resolution,[],[f26,f10]) ).
fof(f58,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),not(X1)),X0))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f26,f6]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(not(X2),not(X0))))
| is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f58,f30]) ).
fof(f158,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f46,f2]) ).
fof(f161,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,not(X1))) ),
inference(resolution,[],[f46,f45]) ).
fof(f277,plain,
! [X0] : is_a_theorem(implies(implies(not(X0),not(implies(not(X0),not(X0)))),X0)),
inference(resolution,[],[f56,f2]) ).
fof(f324,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(resolution,[],[f161,f5]) ).
fof(f617,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(X0)),X0))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f75,f158]) ).
fof(f651,definition,
( spl0_15
<=> ! [X0] : is_a_theorem(implies(not(not(X0)),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f652,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f651]) ).
fof(f653,plain,
( spl0_3
| spl0_15 ),
inference(avatar_split_clause,[],[f617,f651,f38]) ).
fof(f655,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_15 ),
inference(resolution,[],[f652,f7]) ).
fof(f712,plain,
( $false
| ~ spl0_15 ),
inference(resolution,[],[f655,f324]) ).
fof(f713,plain,
~ spl0_15,
inference(avatar_contradiction_clause,[],[f712]) ).
fof(f716,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f39,f277]) ).
fof(f765,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f716]) ).
cnf(s20,plain,
( spl0_3
| spl0_15 ),
inference(sat_conversion,[],[f653]) ).
cnf(s21,plain,
~ spl0_15,
inference(sat_conversion,[],[f713]) ).
cnf(s37,plain,
~ spl0_3,
inference(sat_conversion,[],[f765]) ).
cnf(s39,plain,
$false,
inference(rat,[],[s20,s21,s37]) ).
fof(f767,plain,
$false,
inference(avatar_sat_refutation,[],[s39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL066-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n001.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Sun Sep 27 15:26:01 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.25/2.04 % (3701802)Input is clausal, will run a generic CNF schedule.
% 4.25/2.04 % (3701810)lrs+10_1_sil=8000:sp=occurrence:random_seed=1998059050:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.25/2.04 % (3701810)First to succeed.
% 4.25/2.04 % (3701810)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3701802"
% 4.25/2.04 % (3701807)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=358826604:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.25/2.04 % (3701809)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1280456767:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.25/2.04 % (3701808)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1946925887:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.25/2.04 % (3701811)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=142834868:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.25/2.04 % (3701813)dis-21_1_sil=8000:lcm=predicate:random_seed=3405764782:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 4.25/2.04 % (3701812)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1866402033:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.25/2.04 % (3701812)Also succeeded, but the first one will report.
% 4.25/2.04 % (3701811)Also succeeded, but the first one will report.
% 4.25/2.04 % (3701813)Instruction limit reached!
% 4.25/2.04 % (3701813)------------------------------
% 4.25/2.04 % (3701813)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.25/2.04 % (3701813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.25/2.04 % (3701813)CaDiCaL version: 2.1.3
% 4.25/2.04 % (3701813)Termination reason: Instruction limit
% 4.25/2.04 % (3701813)Termination phase: Saturation
% 4.25/2.04 % (3701813)Time elapsed: 0.104 s
% 4.25/2.04 % (3701813)Peak memory usage: 88 MB
% 4.25/2.04 % (3701813)Instructions burned: 117 (million)
% 4.25/2.04 % (3701810)Refutation found. Thanks to Tanya!
% 4.25/2.04 % SZS status Unsatisfiable for theBenchmark
% 4.25/2.04 % SZS output start Proof for theBenchmark
% See solution above
% 4.25/2.04 % (3701810)------------------------------
% 4.25/2.04 % (3701810)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.25/2.04 % (3701810)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.25/2.04 % (3701810)CaDiCaL version: 2.1.3
% 4.25/2.04 % (3701810)Termination reason: Refutation
% 4.25/2.04 % (3701810)Time elapsed: 0.015 s
% 4.25/2.04 % (3701810)Peak memory usage: 89 MB
% 4.25/2.04 % (3701810)Instructions burned: 25 (million)
% 4.25/2.04 % (3701810)------------------------------
% 4.25/2.04 % (3701810)------------------------------
% 4.25/2.04 % (3701802)Success in time 0.463 s
% 4.25/2.04 % Vampire exiting
%------------------------------------------------------------------------------