%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL089-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 : n011.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:37 AM UTC 2026
% Result : Unsatisfiable 0.34s 0.54s
% Output : Refutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 79 ( 17 unt; 9 def)
% Number of atoms : 178 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 206 ( 107 ~; 90 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 11 ( 10 usr; 10 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 145 ( 0 sgn 145 !; 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(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_4) ).
fof(f4,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f5,plain,
! [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))))),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f6,plain,
is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f7,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,[],[f5,f4]) ).
fof(f8,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,[],[f7,f5]) ).
fof(f10,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,[],[f8,f4]) ).
fof(f12,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(f13,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,[],[f12]) ).
fof(f15,definition,
( spl0_2
<=> ! [X0] : is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f16,plain,
( ! [X0] : is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f17,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f10,f15,f12]) ).
fof(f18,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f16,f5]) ).
fof(f21,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f18]) ).
fof(f27,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,[],[f13,f4]) ).
fof(f30,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2)))))
| ~ spl0_1 ),
inference(resolution,[],[f27,f13]) ).
fof(f52,plain,
( ! [X2,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))) )
| ~ spl0_1 ),
inference(resolution,[],[f30,f4]) ).
fof(f54,definition,
( spl0_4
<=> ! [X2,X1] : ~ is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f55,plain,
( ! [X2,X1] : ~ is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f56,plain,
( spl0_4
| spl0_2
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f52,f12,f15,f54]) ).
fof(f57,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X2,X1))))
| ~ spl0_4 ),
inference(resolution,[],[f55,f7]) ).
fof(f81,plain,
( ! [X2,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))) )
| ~ spl0_4 ),
inference(resolution,[],[f57,f4]) ).
fof(f83,definition,
( spl0_6
<=> ! [X2,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f84,plain,
( ! [X2,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f85,plain,
( spl0_6
| spl0_2
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f81,f54,f15,f83]) ).
fof(f86,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
| ~ spl0_1
| ~ spl0_6 ),
inference(resolution,[],[f84,f27]) ).
fof(f91,plain,
( ! [X2,X3,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X3),implies(X2,X3))))
| ~ spl0_1
| ~ spl0_6 ),
inference(resolution,[],[f86,f7]) ).
fof(f95,plain,
( ! [X2,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,implies(X2,X1))) )
| ~ spl0_1
| ~ spl0_6 ),
inference(resolution,[],[f86,f4]) ).
fof(f97,definition,
( spl0_7
<=> ! [X2,X1] : ~ is_a_theorem(implies(X1,implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f98,plain,
( ! [X2,X1] : ~ is_a_theorem(implies(X1,implies(X2,X1)))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f99,plain,
( spl0_7
| spl0_2
| ~ spl0_1
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f95,f83,f12,f15,f97]) ).
fof(f100,plain,
( ! [X2,X3,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1))))
| ~ spl0_7 ),
inference(resolution,[],[f98,f7]) ).
fof(f215,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) )
| ~ spl0_7 ),
inference(resolution,[],[f100,f4]) ).
fof(f217,definition,
( spl0_17
<=> ! [X2,X1,X3] : ~ is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f218,plain,
( ! [X2,X3,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f219,plain,
( spl0_17
| spl0_2
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f215,f97,f15,f217]) ).
fof(f225,plain,
( ! [X2,X3,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2)))))
| ~ spl0_17 ),
inference(resolution,[],[f218,f7]) ).
fof(f399,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))) )
| ~ spl0_1
| ~ spl0_6 ),
inference(resolution,[],[f91,f4]) ).
fof(f401,definition,
( spl0_28
<=> ! [X2,X1,X3] : ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))) ),
introduced(definition,[new_symbols(definition,[spl0_28])],[avatar_definition]) ).
fof(f402,plain,
( ! [X2,X3,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3)))
| ~ spl0_28 ),
inference(avatar_component_clause,[],[f401]) ).
fof(f403,plain,
( spl0_28
| spl0_2
| ~ spl0_1
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f399,f83,f12,f15,f401]) ).
fof(f417,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X2))
| ~ is_a_theorem(implies(X1,X2)) )
| ~ spl0_28 ),
inference(resolution,[],[f402,f4]) ).
fof(f455,plain,
( ! [X2,X3,X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(X2,implies(implies(X1,X3),implies(X0,X3)))))
| ~ spl0_28 ),
inference(resolution,[],[f417,f5]) ).
fof(f1079,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2)))) )
| ~ spl0_17 ),
inference(resolution,[],[f225,f4]) ).
fof(f1081,definition,
( spl0_56
<=> ! [X2,X1,X3] : ~ is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_56])],[avatar_definition]) ).
fof(f1082,plain,
( ! [X2,X3,X1] : ~ is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2))))
| ~ spl0_56 ),
inference(avatar_component_clause,[],[f1081]) ).
fof(f1083,plain,
( spl0_56
| spl0_2
| ~ spl0_17 ),
inference(avatar_split_clause,[],[f1079,f217,f15,f1081]) ).
fof(f1106,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X0,X1)))
| ~ is_a_theorem(implies(X2,implies(X0,X1))) )
| ~ spl0_56 ),
inference(resolution,[],[f1082,f4]) ).
fof(f1119,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(X1,implies(X1,X2)),implies(X1,X2))))
| ~ spl0_56 ),
inference(resolution,[],[f1106,f1082]) ).
fof(f1472,plain,
( ! [X2,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) )
| ~ spl0_56 ),
inference(resolution,[],[f1119,f4]) ).
fof(f1474,definition,
( spl0_68
<=> ! [X2,X1] : ~ is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
introduced(definition,[new_symbols(definition,[spl0_68])],[avatar_definition]) ).
fof(f1475,plain,
( ! [X2,X1] : ~ is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ spl0_68 ),
inference(avatar_component_clause,[],[f1474]) ).
fof(f1476,plain,
( spl0_68
| spl0_2
| ~ spl0_56 ),
inference(avatar_split_clause,[],[f1472,f1081,f15,f1474]) ).
fof(f1501,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X0,implies(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl0_68 ),
inference(resolution,[],[f1475,f4]) ).
fof(f1839,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ spl0_28
| ~ spl0_68 ),
inference(resolution,[],[f455,f1501]) ).
fof(f1887,plain,
( $false
| ~ spl0_28
| ~ spl0_68 ),
inference(resolution,[],[f1839,f6]) ).
fof(f1905,plain,
( ~ spl0_28
| ~ spl0_68 ),
inference(avatar_contradiction_clause,[],[f1887]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f17]) ).
cnf(s3,plain,
~ spl0_2,
inference(sat_conversion,[],[f21]) ).
cnf(s5,plain,
( ~ spl0_1
| spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f56]) ).
cnf(s7,plain,
( spl0_2
| ~ spl0_4
| spl0_6 ),
inference(sat_conversion,[],[f85]) ).
cnf(s8,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_6
| spl0_7 ),
inference(sat_conversion,[],[f99]) ).
cnf(s20,plain,
( spl0_2
| ~ spl0_7
| spl0_17 ),
inference(sat_conversion,[],[f219]) ).
cnf(s31,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_6
| spl0_28 ),
inference(sat_conversion,[],[f403]) ).
cnf(s75,plain,
( spl0_2
| ~ spl0_17
| spl0_56 ),
inference(sat_conversion,[],[f1083]) ).
cnf(s105,plain,
( spl0_2
| ~ spl0_56
| spl0_68 ),
inference(sat_conversion,[],[f1476]) ).
cnf(s123,plain,
( ~ spl0_28
| ~ spl0_68 ),
inference(sat_conversion,[],[f1905]) ).
cnf(s126,plain,
spl0_1,
inference(rat,[],[s1,s3]) ).
cnf(s128,plain,
spl0_4,
inference(rat,[],[s5,s3,s126]) ).
cnf(s130,plain,
spl0_6,
inference(rat,[],[s7,s3,s128]) ).
cnf(s144,plain,
spl0_28,
inference(rat,[],[s31,s126,s3,s130]) ).
cnf(s145,plain,
spl0_7,
inference(rat,[],[s8,s126,s3,s130]) ).
cnf(s151,plain,
~ spl0_68,
inference(rat,[],[s123,s144]) ).
cnf(s153,plain,
spl0_17,
inference(rat,[],[s20,s3,s145]) ).
cnf(s163,plain,
~ spl0_56,
inference(rat,[],[s105,s3,s151]) ).
cnf(s167,plain,
$false,
inference(rat,[],[s75,s3,s163,s153]) ).
fof(f1906,plain,
$false,
inference(avatar_sat_refutation,[],[s167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL089-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.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 15:21:30 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.34/0.54 % (2543075)Will run a generic schedule for satisfiability detection.
% 0.34/0.54 % (2543086)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3241480222:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.34/0.54 % (2543083)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3562718604_2999 on theBenchmark for (2999ds/0Mi)
% 0.34/0.54 % (2543088)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2548019620:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.34/0.54 % (2543087)dis+10_1_sil=32000:sp=arity:random_seed=1726606769:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.34/0.54 % TRYING [1]
% 0.34/0.54 % TRYING [2]
% 0.34/0.54 % TRYING [3]
% 0.34/0.54 % (2543085)% WARNING: option uhcvi not known.
% 0.34/0.54 % (2543085)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1391846098:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.34/0.54 % TRYING [4]
% 0.34/0.54 % (2543089)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3759210457:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.34/0.54 % (2543090)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4225555872:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.34/0.54 % (2543090) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2543075-2543090"...
% 0.34/0.54 % (2543090)...printing done.
% 0.34/0.54 % (2543087)Instruction limit reached!
% 0.34/0.54 % (2543087)------------------------------
% 0.34/0.54 % (2543087)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.54 % (2543087)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.54 % (2543087)CaDiCaL version: 2.1.3
% 0.34/0.54 % (2543087)Termination reason: Instruction limit
% 0.34/0.54 % (2543087)Termination phase: Saturation
% 0.34/0.54 % (2543090)Refutation found. Thanks to Tanya!
% 0.34/0.54 % SZS status Unsatisfiable for theBenchmark
% 0.34/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.34/0.54 % (2543090)------------------------------
% 0.34/0.54 % (2543090)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.54 % (2543090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.54 % (2543090)CaDiCaL version: 2.1.3
% 0.34/0.54 % (2543090)Termination reason: Refutation
% 0.34/0.54 % (2543090)Time elapsed: 0.054 s
% 0.34/0.54 % (2543090)Peak memory usage: 13 MB
% 0.34/0.54 % (2543090)Instructions burned: 52 (million)
% 0.34/0.54 % (2543075)Success in time 0.117 s
% 0.34/0.54 % Vampire exiting
%------------------------------------------------------------------------------