%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL086-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:36 AM UTC 2026
% Result : Unsatisfiable 0.29s 0.63s
% Output : Refutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 61 ( 16 unt; 7 def)
% Number of atoms : 129 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 143 ( 75 ~; 61 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 9 ( 8 usr; 8 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn 101 !; 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,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/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz_4) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_1) ).
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(a,a)),
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(f9,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,[],[f9,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(f50,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,[],[f50,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(f79,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,[],[f79,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(f93,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,[],[f93,f83,f12,f15,f97]) ).
fof(f102,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(f199,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,[],[f102,f4]) ).
fof(f204,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(f205,plain,
( ! [X2,X3,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f204]) ).
fof(f206,plain,
( spl0_17
| spl0_2
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f199,f97,f15,f204]) ).
fof(f216,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X0))
| ~ is_a_theorem(implies(X2,X0)) )
| ~ spl0_17 ),
inference(resolution,[],[f205,f4]) ).
fof(f217,plain,
( ! [X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,X1)))
| ~ spl0_17 ),
inference(resolution,[],[f216,f205]) ).
fof(f240,plain,
( ! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X1)) )
| ~ spl0_17 ),
inference(resolution,[],[f217,f4]) ).
fof(f246,definition,
( spl0_19
<=> ! [X1] : ~ is_a_theorem(implies(X1,X1)) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f247,plain,
( ! [X1] : ~ is_a_theorem(implies(X1,X1))
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f248,plain,
( spl0_19
| spl0_2
| ~ spl0_17 ),
inference(avatar_split_clause,[],[f240,f204,f15,f246]) ).
fof(f253,plain,
( $false
| ~ spl0_19 ),
inference(resolution,[],[f247,f6]) ).
fof(f258,plain,
~ spl0_19,
inference(avatar_contradiction_clause,[],[f253]) ).
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,[],[f206]) ).
cnf(s22,plain,
( spl0_2
| ~ spl0_17
| spl0_19 ),
inference(sat_conversion,[],[f248]) ).
cnf(s24,plain,
~ spl0_19,
inference(sat_conversion,[],[f258]) ).
cnf(s25,plain,
( spl0_2
| ~ spl0_17 ),
inference(rat,[],[s22,s24]) ).
cnf(s26,plain,
~ spl0_17,
inference(rat,[],[s25,s3]) ).
cnf(s27,plain,
~ spl0_7,
inference(rat,[],[s20,s26,s3]) ).
cnf(s29,plain,
spl0_1,
inference(rat,[],[s1,s3]) ).
cnf(s30,plain,
~ spl0_6,
inference(rat,[],[s8,s27,s3,s29]) ).
cnf(s31,plain,
spl0_4,
inference(rat,[],[s5,s3,s29]) ).
cnf(s33,plain,
$false,
inference(rat,[],[s7,s3,s30,s31]) ).
fof(f259,plain,
$false,
inference(avatar_sat_refutation,[],[s33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL086-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.21/0.49 % Computer : n010.cluster.edu
% 0.21/0.49 % Model : x86_64 x86_64
% 0.21/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.49 % Memory : 8046.5625MB
% 0.21/0.49 % OS : Linux 6.8.0-71-generic
% 0.21/0.49 % CPULimit : 300
% 0.21/0.49 % WCLimit : 300
% 0.21/0.49 % DateTime : Sun Sep 27 15:21:32 UTC 2026
% 0.21/0.49 % CPUTime :
% 0.21/0.49 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.54 Running first-order model finding
% 0.25/0.54 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.63 % (1084476)Will run a generic schedule for satisfiability detection.
% 0.29/0.63 % (1084485)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4075484173:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.29/0.63 % (1084482)% WARNING: option uhcvi not known.
% 0.29/0.63 % (1084481)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1488122448_2999 on theBenchmark for (2999ds/0Mi)
% 0.29/0.63 % (1084487)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=453587923:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.29/0.63 % (1084486)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3766866082:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.29/0.63 % (1084483)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2011616126:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.29/0.63 % (1084484)dis+10_1_sil=32000:sp=arity:random_seed=368533908:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.29/0.63 % (1084482)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1430745263:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.29/0.63 % TRYING [1]
% 0.29/0.63 % TRYING [2]
% 0.29/0.63 % TRYING [3]
% 0.29/0.63 % TRYING [4]
% 0.29/0.63 % (1084487) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1084476-1084487"...
% 0.29/0.63 % (1084483) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1084476-1084483"...
% 0.29/0.63 % (1084487)...printing done.
% 0.29/0.63 % (1084487)Refutation found. Thanks to Tanya!
% 0.29/0.63 % SZS status Unsatisfiable for theBenchmark
% 0.29/0.63 % SZS output start Proof for theBenchmark
% See solution above
% 0.29/0.63 % (1084487)------------------------------
% 0.29/0.63 % (1084487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.63 % (1084487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.63 % (1084487)CaDiCaL version: 2.1.3
% 0.29/0.63 % (1084487)Termination reason: Refutation
% 0.29/0.63 % (1084487)Time elapsed: 0.011 s
% 0.29/0.63 % (1084487)Peak memory usage: 12 MB
% 0.29/0.63 % (1084487)Instructions burned: 8 (million)
% 0.29/0.63 % (1084476)Success in time 0.057 s
% 0.29/0.63 % Vampire exiting
%------------------------------------------------------------------------------