%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n006.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.18s 0.46s
% Output : Refutation 0.18s
% 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(f65,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(f70,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(f71,plain,
( ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f72,plain,
( spl0_7
| spl0_2
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f65,f9,f12,f70]) ).
fof(f73,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X2,X1))))
| ~ spl0_7 ),
inference(resolution,[],[f71,f4]) ).
fof(f105,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))) )
| ~ spl0_7 ),
inference(resolution,[],[f73,f1]) ).
fof(f111,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(f112,plain,
( ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( spl0_8
| spl0_2
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f105,f70,f12,f111]) ).
fof(f119,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
| ~ spl0_1
| ~ spl0_8 ),
inference(resolution,[],[f112,f20]) ).
fof(f132,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(X2,X1))) )
| ~ spl0_1
| ~ spl0_8 ),
inference(resolution,[],[f119,f1]) ).
fof(f138,definition,
( spl0_9
<=> ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f139,plain,
( ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1)))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f140,plain,
( spl0_9
| spl0_2
| ~ spl0_1
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f132,f111,f9,f12,f138]) ).
fof(f151,plain,
( $false
| ~ spl0_9 ),
inference(resolution,[],[f139,f3]) ).
fof(f158,plain,
~ spl0_9,
inference(avatar_contradiction_clause,[],[f151]) ).
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,[],[f72]) ).
cnf(s9,plain,
( spl0_2
| ~ spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f113]) ).
cnf(s10,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f140]) ).
cnf(s12,plain,
~ spl0_9,
inference(sat_conversion,[],[f158]) ).
cnf(s13,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_8 ),
inference(rat,[],[s10,s12]) ).
cnf(s16,plain,
spl0_1,
inference(rat,[],[s1,s3]) ).
cnf(s18,plain,
~ spl0_8,
inference(rat,[],[s13,s3,s16]) ).
cnf(s19,plain,
spl0_7,
inference(rat,[],[s8,s3,s16]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s9,s3,s18,s19]) ).
fof(f159,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL087-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n006.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:20:56 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.18/0.46 % (3088839)Will run a generic schedule for satisfiability detection.
% 0.18/0.46 % (3088849)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=336523705:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.46 % (3088849) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3088839-3088849"...
% 0.18/0.46 % (3088845)% WARNING: option uhcvi not known.
% 0.18/0.46 % (3088849)...printing done.
% 0.18/0.46 % (3088849)Refutation found. Thanks to Tanya!
% 0.18/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46 % (3088849)------------------------------
% 0.18/0.46 % (3088849)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46 % (3088849)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46 % (3088849)CaDiCaL version: 2.1.3
% 0.18/0.46 % (3088849)Termination reason: Refutation
% 0.18/0.46 % (3088849)Time elapsed: 0.003 s
% 0.18/0.46 % (3088849)Peak memory usage: 12 MB
% 0.18/0.46 % (3088849)Instructions burned: 6 (million)
% 0.18/0.46 % (3088839)Success in time 0.035 s
% 0.18/0.46 % Vampire exiting
%------------------------------------------------------------------------------