%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL072-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 : n004.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:06 AM UTC 2026
% Result : Unsatisfiable 5.47s 1.85s
% Output : Refutation 5.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 16 unt; 3 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 83 ( 46 ~; 34 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 62 !; 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,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_19) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_37) ).
fof(f4,axiom,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X2)),implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_60) ).
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,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f2,f1]) ).
fof(f7,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(not(X0),X2)) ),
inference(resolution,[],[f3,f1]) ).
fof(f8,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f6,f2]) ).
fof(f10,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(X2,implies(implies(X3,X1),implies(implies(X0,X3),X1))))),
inference(resolution,[],[f4,f6]) ).
fof(f15,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(not(X0),X2))),
inference(resolution,[],[f7,f3]) ).
fof(f17,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f7,f8]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X2,implies(implies(X3,X1),implies(implies(X0,X3),X1))))
| ~ is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[],[f10,f1]) ).
fof(f64,definition,
( spl0_3
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f65,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f70,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f65,f2]) ).
fof(f97,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f70]) ).
fof(f138,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1))) ),
inference(resolution,[],[f39,f1]) ).
fof(f142,definition,
( spl0_7
<=> ! [X0,X1,X3] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1))) ) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f143,plain,
( ! [X3,X0,X1] :
( is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1)))
| ~ is_a_theorem(implies(not(X0),X1)) )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f144,plain,
( spl0_3
| spl0_7 ),
inference(avatar_split_clause,[],[f138,f142,f64]) ).
fof(f145,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(not(X2),implies(implies(X0,X2),X1)))
| ~ is_a_theorem(implies(not(X0),X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f143,f7]) ).
fof(f147,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X2),X1))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(not(X0),X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f143,f1]) ).
fof(f151,plain,
( ! [X2,X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X2),X1))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f147,f1]) ).
fof(f159,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),implies(a,implies(not(a),b))))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X1,implies(a,implies(not(a),b)))) )
| ~ spl0_7 ),
inference(resolution,[],[f151,f5]) ).
fof(f487,definition,
( spl0_41
<=> ! [X0] : ~ is_a_theorem(implies(not(X0),implies(not(a),b))) ),
introduced(definition,[new_symbols(definition,[spl0_41])],[avatar_definition]) ).
fof(f488,plain,
( ! [X0] : ~ is_a_theorem(implies(not(X0),implies(not(a),b)))
| ~ spl0_41 ),
inference(avatar_component_clause,[],[f487]) ).
fof(f654,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(a,implies(not(a),b))))
| ~ is_a_theorem(implies(not(a),X0)) )
| ~ spl0_7 ),
inference(resolution,[],[f159,f17]) ).
fof(f977,plain,
( $false
| ~ spl0_41 ),
inference(resolution,[],[f488,f15]) ).
fof(f990,plain,
~ spl0_41,
inference(avatar_contradiction_clause,[],[f977]) ).
fof(f1460,plain,
( ! [X0] : ~ is_a_theorem(implies(not(a),implies(implies(X0,a),implies(not(a),b))))
| ~ spl0_7 ),
inference(resolution,[],[f654,f2]) ).
fof(f1535,plain,
( ! [X0] : ~ is_a_theorem(implies(not(X0),implies(not(a),b)))
| ~ spl0_7 ),
inference(resolution,[],[f1460,f145]) ).
fof(f1547,plain,
( spl0_41
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f1535,f142,f487]) ).
cnf(s12,plain,
~ spl0_3,
inference(sat_conversion,[],[f97]) ).
cnf(s21,plain,
( spl0_3
| spl0_7 ),
inference(sat_conversion,[],[f144]) ).
cnf(s64,plain,
~ spl0_41,
inference(sat_conversion,[],[f990]) ).
cnf(s74,plain,
( ~ spl0_7
| spl0_41 ),
inference(sat_conversion,[],[f1547]) ).
cnf(s76,plain,
~ spl0_7,
inference(rat,[],[s74,s64]) ).
cnf(s77,plain,
spl0_3,
inference(rat,[],[s21,s76]) ).
cnf(s80,plain,
$false,
inference(rat,[],[s12,s77]) ).
fof(f1549,plain,
$false,
inference(avatar_sat_refutation,[],[s80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL072-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.50 % Computer : n004.cluster.edu
% 0.22/0.50 % Model : x86_64 x86_64
% 0.22/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.50 % Memory : 8046.5625MB
% 0.22/0.50 % OS : Linux 6.8.0-71-generic
% 0.22/0.50 % CPULimit : 300
% 0.22/0.50 % WCLimit : 300
% 0.22/0.50 % DateTime : Sun Sep 27 15:20:37 UTC 2026
% 0.26/0.51 % CPUTime :
% 0.26/0.51 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.57 Running first-order theorem proving
% 0.26/0.57 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
% 5.47/1.85 % (3653863)Input is clausal, will run a generic CNF schedule.
% 5.47/1.85 % (3653873)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3584819244:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 5.47/1.85 % (3653869)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4065493852:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 5.47/1.85 % (3653872)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2081046827:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 5.47/1.85 % (3653871)lrs+10_1_sil=8000:sp=occurrence:random_seed=3831557353:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 5.47/1.85 % (3653870)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=269987780:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 5.47/1.85 % (3653874)dis-21_1_sil=8000:lcm=predicate:random_seed=406495329: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)
% 5.47/1.85 % (3653868)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=3318006643:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 5.47/1.85 % (3653874)First to succeed.
% 5.47/1.85 % (3653874)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3653863"
% 5.47/1.85 % (3653872)Instruction limit reached!
% 5.47/1.85 % (3653872)------------------------------
% 5.47/1.85 % (3653872)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.47/1.85 % (3653872)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.85 % (3653872)CaDiCaL version: 2.1.3
% 5.47/1.85 % (3653872)Termination reason: Instruction limit
% 5.47/1.85 % (3653872)Termination phase: Saturation
% 5.47/1.85 % (3653872)Time elapsed: 0.106 s
% 5.47/1.85 % (3653872)Peak memory usage: 88 MB
% 5.47/1.85 % (3653872)Instructions burned: 115 (million)
% 5.47/1.85 % (3653871)Instruction limit reached!
% 5.47/1.85 % (3653871)------------------------------
% 5.47/1.85 % (3653871)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.47/1.85 % (3653871)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.85 % (3653871)CaDiCaL version: 2.1.3
% 5.47/1.85 % (3653871)Termination reason: Instruction limit
% 5.47/1.85 % (3653871)Termination phase: Saturation
% 5.47/1.85 % (3653871)Time elapsed: 0.108 s
% 5.47/1.85 % (3653871)Peak memory usage: 88 MB
% 5.47/1.85 % (3653871)Instructions burned: 108 (million)
% 5.47/1.85 % (3653873)Instruction limit reached!
% 5.47/1.85 % (3653873)------------------------------
% 5.47/1.85 % (3653873)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.47/1.85 % (3653873)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.85 % (3653873)CaDiCaL version: 2.1.3
% 5.47/1.85 % (3653873)Termination reason: Instruction limit
% 5.47/1.85 % (3653873)Termination phase: Saturation
% 5.47/1.85 % (3653873)Time elapsed: 0.176 s
% 5.47/1.85 % (3653873)Peak memory usage: 90 MB
% 5.47/1.85 % (3653873)Instructions burned: 181 (million)
% 5.47/1.85 % (3653882)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2705011342:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 5.47/1.85 % (3653882)Refutation not found, incomplete strategy
% 5.47/1.85 % (3653882)------------------------------
% 5.47/1.85 % (3653882)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.47/1.85 % (3653882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.85 % (3653882)CaDiCaL version: 2.1.3
% 5.47/1.85 % (3653882)Termination reason: Refutation not found, incomplete strategy
% 5.47/1.85 % (3653882)Time elapsed: 0.001 s
% 5.47/1.85 % (3653882)Peak memory usage: 87 MB
% 5.47/1.85 % (3653883)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=318205437:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 5.47/1.85 % (3653884)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2766522892:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 5.47/1.85 % (3653884)Refutation not found, incomplete strategy
% 5.47/1.85 % (3653884)------------------------------
% 5.47/1.85 % (3653884)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.47/1.85 % (3653884)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.85 % (3653884)CaDiCaL version: 2.1.3
% 5.47/1.85 % (3653884)Termination reason: Refutation not found, incomplete strategy
% 5.47/1.85 % (3653884)Time elapsed: 0.001 s
% 5.47/1.85 % (3653884)Peak memory usage: 87 MB
% 5.47/1.85 % (3653874)Refutation found. Thanks to Tanya!
% 5.47/1.85 % SZS status Unsatisfiable for theBenchmark
% 5.47/1.85 % SZS output start Proof for theBenchmark
% See solution above
% 5.47/1.85 % (3653874)------------------------------
% 5.47/1.85 % (3653874)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.47/1.85 % (3653874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.85 % (3653874)CaDiCaL version: 2.1.3
% 5.47/1.85 % (3653874)Termination reason: Refutation
% 5.47/1.85 % (3653874)Time elapsed: 0.044 s
% 5.47/1.85 % (3653874)Peak memory usage: 89 MB
% 5.47/1.85 % (3653874)Instructions burned: 44 (million)
% 5.47/1.85 % (3653874)------------------------------
% 5.47/1.85 % (3653874)------------------------------
% 5.47/1.85 % (3653863)Success in time 0.689 s
% 5.47/1.85 % Vampire exiting
%------------------------------------------------------------------------------