%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL082-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:08 AM UTC 2026
% Result : Unsatisfiable 2.82s 1.42s
% Output : Refutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 13 unt; 3 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 25 ~; 21 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 61 !; 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,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_2) ).
fof(f4,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(implies(X2,X0),implies(X3,X0))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(implies(X3,X1),implies(X4,X1))),implies(X5,implies(implies(X3,X1),implies(X4,X1))))),
inference(resolution,[],[f5,f4]) ).
fof(f7,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))
| is_a_theorem(implies(X4,implies(X1,X3))) ),
inference(resolution,[],[f5,f1]) ).
fof(f16,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f17,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f19,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,X1),implies(implies(X2,X1),implies(X1,X1))))),
inference(resolution,[],[f6,f7]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X3,X1),implies(X4,X1))))
| is_a_theorem(implies(X5,implies(implies(X3,X1),implies(X4,X1)))) ),
inference(resolution,[],[f6,f1]) ).
fof(f24,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f19,f17]) ).
fof(f25,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f24]) ).
fof(f41,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1)))),
inference(resolution,[],[f21,f2]) ).
fof(f58,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) ),
inference(resolution,[],[f41,f1]) ).
fof(f63,definition,
( spl0_5
<=> ! [X2,X1,X3] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f64,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f65,plain,
( spl0_5
| spl0_2 ),
inference(avatar_split_clause,[],[f58,f16,f63]) ).
fof(f92,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
| ~ spl0_5 ),
inference(resolution,[],[f64,f7]) ).
fof(f105,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(X2,X1))) )
| ~ spl0_5 ),
inference(resolution,[],[f92,f1]) ).
fof(f110,definition,
( spl0_6
<=> ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f111,plain,
( ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1)))
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f112,plain,
( spl0_6
| spl0_2
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f105,f63,f16,f110]) ).
fof(f123,plain,
( $false
| ~ spl0_6 ),
inference(resolution,[],[f111,f3]) ).
fof(f124,plain,
~ spl0_6,
inference(avatar_contradiction_clause,[],[f123]) ).
cnf(s3,plain,
~ spl0_2,
inference(sat_conversion,[],[f25]) ).
cnf(s6,plain,
( spl0_2
| spl0_5 ),
inference(sat_conversion,[],[f65]) ).
cnf(s7,plain,
( spl0_2
| ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f112]) ).
cnf(s8,plain,
~ spl0_6,
inference(sat_conversion,[],[f124]) ).
cnf(s9,plain,
( spl0_2
| ~ spl0_5 ),
inference(rat,[],[s7,s8]) ).
cnf(s10,plain,
~ spl0_5,
inference(rat,[],[s9,s3]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s6,s10,s3]) ).
fof(f125,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL082-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n018.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:23:23 UTC 2026
% 0.05/0.38 % CPUTime :
% 0.05/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.43 Running first-order theorem proving
% 0.05/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.82/1.42 % (2501168)Input is clausal, will run a generic CNF schedule.
% 2.82/1.42 % (2501177)lrs+10_1_sil=8000:sp=occurrence:random_seed=3595067984:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.82/1.42 % (2501177)First to succeed.
% 2.82/1.42 % (2501177)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2501168"
% 2.82/1.42 % (2501179)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2599816735:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.82/1.42 % (2501175)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=907246325:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.82/1.42 % (2501178)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=8516684:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.82/1.42 % (2501174)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=3521228518:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.82/1.42 % (2501180)dis-21_1_sil=8000:lcm=predicate:random_seed=1157925797: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)
% 2.82/1.42 % (2501176)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=639560511:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.82/1.42 % (2501178)Also succeeded, but the first one will report.
% 2.82/1.42 % (2501179)Also succeeded, but the first one will report.
% 2.82/1.42 % (2501180)Instruction limit reached!
% 2.82/1.42 % (2501180)------------------------------
% 2.82/1.42 % (2501180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.82/1.42 % (2501180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.82/1.42 % (2501180)CaDiCaL version: 2.1.3
% 2.82/1.42 % (2501180)Termination reason: Instruction limit
% 2.82/1.42 % (2501180)Termination phase: Saturation
% 2.82/1.42 % (2501180)Time elapsed: 0.072 s
% 2.82/1.42 % (2501180)Peak memory usage: 88 MB
% 2.82/1.42 % (2501180)Instructions burned: 117 (million)
% 2.82/1.42 % (2501177)Refutation found. Thanks to Tanya!
% 2.82/1.42 % SZS status Unsatisfiable for theBenchmark
% 2.82/1.42 % SZS output start Proof for theBenchmark
% See solution above
% 2.82/1.42 % (2501177)------------------------------
% 2.82/1.42 % (2501177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.82/1.42 % (2501177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.82/1.42 % (2501177)CaDiCaL version: 2.1.3
% 2.82/1.42 % (2501177)Termination reason: Refutation
% 2.82/1.42 % (2501177)Time elapsed: 0.003 s
% 2.82/1.42 % (2501177)Peak memory usage: 89 MB
% 2.82/1.42 % (2501177)Instructions burned: 4 (million)
% 2.82/1.42 % (2501177)------------------------------
% 2.82/1.42 % (2501177)------------------------------
% 2.82/1.42 % (2501168)Success in time 0.303 s
% 2.82/1.42 % Vampire exiting
%------------------------------------------------------------------------------