%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL087-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 : n017.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:09 AM UTC 2026
% Result : Unsatisfiable 3.30s 1.22s
% Output : Refutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 12 unt; 5 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 89 ( 42 ~; 42 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 71 !; 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,X4] : is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X3)),implies(X4,implies(implies(X3,X0),implies(X2,X0))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz_4) ).
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,X4] :
( ~ is_a_theorem(implies(implies(X0,X1),implies(X2,X3)))
| is_a_theorem(implies(X4,implies(implies(X3,X0),implies(X2,X0)))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))) ),
inference(resolution,[],[f5,f1]) ).
fof(f9,definition,
( spl0_1
<=> ! [X3,X4,X5,X2,X1] : is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f10,plain,
( ! [X2,X3,X1,X4,X5] : is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f9]) ).
fof(f12,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f13,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f12]) ).
fof(f14,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f6,f12,f9]) ).
fof(f15,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f13,f2]) ).
fof(f18,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f15]) ).
fof(f20,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))) )
| ~ spl0_1 ),
inference(resolution,[],[f10,f1]) ).
fof(f29,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2)))))
| ~ spl0_1 ),
inference(resolution,[],[f20,f10]) ).
fof(f59,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))) )
| ~ spl0_1 ),
inference(resolution,[],[f29,f1]) ).
fof(f63,definition,
( spl0_7
<=> ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f64,plain,
( ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f65,plain,
( spl0_7
| spl0_2
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f59,f9,f12,f63]) ).
fof(f66,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X2,X1))))
| ~ spl0_7 ),
inference(resolution,[],[f64,f4]) ).
fof(f113,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))) )
| ~ spl0_7 ),
inference(resolution,[],[f66,f1]) ).
fof(f118,definition,
( spl0_8
<=> ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f119,plain,
( ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f120,plain,
( spl0_8
| spl0_2
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f113,f63,f12,f118]) ).
fof(f130,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
| ~ spl0_1
| ~ spl0_8 ),
inference(resolution,[],[f119,f20]) ).
fof(f145,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(X2,X1))) )
| ~ spl0_1
| ~ spl0_8 ),
inference(resolution,[],[f130,f1]) ).
fof(f150,definition,
( spl0_11
<=> ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f151,plain,
( ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1)))
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f150]) ).
fof(f152,plain,
( spl0_11
| spl0_2
| ~ spl0_1
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f145,f118,f9,f12,f150]) ).
fof(f163,plain,
( $false
| ~ spl0_11 ),
inference(resolution,[],[f151,f3]) ).
fof(f164,plain,
~ spl0_11,
inference(avatar_contradiction_clause,[],[f163]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f14]) ).
cnf(s3,plain,
~ spl0_2,
inference(sat_conversion,[],[f18]) ).
cnf(s8,plain,
( ~ spl0_1
| spl0_2
| spl0_7 ),
inference(sat_conversion,[],[f65]) ).
cnf(s9,plain,
( spl0_2
| ~ spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f120]) ).
cnf(s12,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_8
| spl0_11 ),
inference(sat_conversion,[],[f152]) ).
cnf(s13,plain,
~ spl0_11,
inference(sat_conversion,[],[f164]) ).
cnf(s14,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_8 ),
inference(rat,[],[s12,s13]) ).
cnf(s18,plain,
spl0_1,
inference(rat,[],[s1,s3]) ).
cnf(s19,plain,
~ spl0_8,
inference(rat,[],[s14,s3,s18]) ).
cnf(s21,plain,
spl0_7,
inference(rat,[],[s8,s3,s18]) ).
cnf(s24,plain,
$false,
inference(rat,[],[s9,s3,s19,s21]) ).
fof(f165,plain,
$false,
inference(avatar_sat_refutation,[],[s24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL087-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n017.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 15:16:35 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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
% 3.30/1.22 % (2718202)Input is clausal, will run a generic CNF schedule.
% 3.30/1.22 % (2718212)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1249386776:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.30/1.22 % (2718209)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=948471530:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.30/1.22 % (2718211)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4159646955:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.30/1.22 % (2718210)lrs+10_1_sil=8000:sp=occurrence:random_seed=2603704698:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.30/1.22 % (2718207)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=697472369:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.30/1.22 % (2718213)dis-21_1_sil=8000:lcm=predicate:random_seed=376775564: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)
% 3.30/1.22 % (2718208)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3357319396:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.30/1.22 % (2718210)First to succeed.
% 3.30/1.22 % (2718210)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2718202"
% 3.30/1.22 % (2718212)Instruction limit reached!
% 3.30/1.22 % (2718212)------------------------------
% 3.30/1.22 % (2718212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.22 % (2718212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.22 % (2718212)CaDiCaL version: 2.1.3
% 3.30/1.22 % (2718212)Termination reason: Instruction limit
% 3.30/1.22 % (2718212)Termination phase: Saturation
% 3.30/1.22 % (2718212)Time elapsed: 0.064 s
% 3.30/1.22 % (2718212)Peak memory usage: 89 MB
% 3.30/1.22 % (2718212)Instructions burned: 183 (million)
% 3.30/1.22 % (2718213)Instruction limit reached!
% 3.30/1.22 % (2718213)------------------------------
% 3.30/1.22 % (2718213)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.22 % (2718213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.22 % (2718213)CaDiCaL version: 2.1.3
% 3.30/1.22 % (2718213)Termination reason: Instruction limit
% 3.30/1.22 % (2718213)Termination phase: Saturation
% 3.30/1.22 % (2718213)Time elapsed: 0.067 s
% 3.30/1.22 % (2718213)Peak memory usage: 88 MB
% 3.30/1.22 % (2718213)Instructions burned: 118 (million)
% 3.30/1.22 % (2718211)Instruction limit reached!
% 3.30/1.22 % (2718211)------------------------------
% 3.30/1.22 % (2718211)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.22 % (2718211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.22 % (2718211)CaDiCaL version: 2.1.3
% 3.30/1.22 % (2718211)Termination reason: Instruction limit
% 3.30/1.22 % (2718211)Termination phase: Saturation
% 3.30/1.22 % (2718211)Time elapsed: 0.076 s
% 3.30/1.22 % (2718211)Peak memory usage: 88 MB
% 3.30/1.22 % (2718211)Instructions burned: 114 (million)
% 3.30/1.22 % (2718221)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=1577851096:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.30/1.22 % (2718221)Refutation not found, incomplete strategy
% 3.30/1.22 % (2718221)------------------------------
% 3.30/1.22 % (2718221)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.22 % (2718221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.22 % (2718221)CaDiCaL version: 2.1.3
% 3.30/1.22 % (2718221)Termination reason: Refutation not found, incomplete strategy
% 3.30/1.22 % (2718221)Time elapsed: 0.0000 s
% 3.30/1.22 % (2718221)Peak memory usage: 87 MB
% 3.30/1.22 % (2718222)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3255030398:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 3.30/1.22 % (2718223)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2150403355:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.30/1.22 % (2718223)Refutation not found, incomplete strategy
% 3.30/1.22 % (2718223)------------------------------
% 3.30/1.22 % (2718223)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.22 % (2718223)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.22 % (2718223)CaDiCaL version: 2.1.3
% 3.30/1.22 % (2718223)Termination reason: Refutation not found, incomplete strategy
% 3.30/1.22 % (2718223)Time elapsed: 0.001 s
% 3.30/1.22 % (2718223)Peak memory usage: 87 MB
% 3.30/1.22 % (2718210)Refutation found. Thanks to Tanya!
% 3.30/1.22 % SZS status Unsatisfiable for theBenchmark
% 3.30/1.22 % SZS output start Proof for theBenchmark
% See solution above
% 3.30/1.22 % (2718210)------------------------------
% 3.30/1.22 % (2718210)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.22 % (2718210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.22 % (2718210)CaDiCaL version: 2.1.3
% 3.30/1.22 % (2718210)Termination reason: Refutation
% 3.30/1.22 % (2718210)Time elapsed: 0.006 s
% 3.30/1.22 % (2718210)Peak memory usage: 89 MB
% 3.30/1.22 % (2718210)Instructions burned: 6 (million)
% 3.30/1.22 % (2718210)------------------------------
% 3.30/1.22 % (2718210)------------------------------
% 3.30/1.22 % (2718202)Success in time 0.403 s
% 3.30/1.22 % Vampire exiting
%------------------------------------------------------------------------------