%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL083-2 : TPTP v9.3.1. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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.37s 0.49s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 19 unt; 4 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 67 ( 33 ~; 30 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 100 !; 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] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(X0,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_1) ).
fof(f4,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_3) ).
fof(f6,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(f7,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,[],[f6,f2]) ).
fof(f8,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0))),
inference(resolution,[],[f6,f3]) ).
fof(f9,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),implies(X1,X2)),implies(X3,implies(X1,X2)))),
inference(resolution,[],[f8,f6]) ).
fof(f12,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,[],[f7,f6]) ).
fof(f18,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(X3,X1)),implies(X4,implies(X3,X1)))),
inference(resolution,[],[f9,f6]) ).
fof(f34,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,[],[f12,f1]) ).
fof(f43,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f44,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f46,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f44,f3]) ).
fof(f65,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f46]) ).
fof(f88,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X3,X1)))
| is_a_theorem(implies(X4,implies(X3,X1))) ),
inference(resolution,[],[f18,f1]) ).
fof(f99,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1)))),
inference(resolution,[],[f34,f2]) ).
fof(f168,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),X0),implies(X2,X0)),X3),implies(X4,X3))),
inference(resolution,[],[f99,f6]) ).
fof(f191,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2)))),
inference(resolution,[],[f88,f2]) ).
fof(f401,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))) ),
inference(resolution,[],[f191,f1]) ).
fof(f403,definition,
( spl0_4
<=> ! [X2,X1,X3] : is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f404,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2)))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f405,plain,
( spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f401,f43,f403]) ).
fof(f456,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),X0),implies(X2,X0)),X3))
| is_a_theorem(implies(X4,X3)) ),
inference(resolution,[],[f168,f1]) ).
fof(f622,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),implies(implies(X0,X1),X2)),implies(X3,implies(implies(X0,X1),X2))))
| ~ spl0_4 ),
inference(resolution,[],[f404,f6]) ).
fof(f3036,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(implies(X2,X3),X2),X2))))
| ~ spl0_4 ),
inference(resolution,[],[f622,f456]) ).
fof(f3081,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))) )
| ~ spl0_4 ),
inference(resolution,[],[f3036,f1]) ).
fof(f3083,definition,
( spl0_29
<=> ! [X2,X1,X3] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))) ),
introduced(definition,[new_symbols(definition,[spl0_29])],[avatar_definition]) ).
fof(f3084,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2)))
| ~ spl0_29 ),
inference(avatar_component_clause,[],[f3083]) ).
fof(f3085,plain,
( spl0_29
| spl0_2
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f3081,f403,f43,f3083]) ).
fof(f3162,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) )
| ~ spl0_29 ),
inference(resolution,[],[f3084,f1]) ).
fof(f3164,definition,
( spl0_31
<=> ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).
fof(f3165,plain,
( ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
| ~ spl0_31 ),
inference(avatar_component_clause,[],[f3164]) ).
fof(f3166,plain,
( spl0_31
| spl0_2
| ~ spl0_29 ),
inference(avatar_split_clause,[],[f3162,f3083,f43,f3164]) ).
fof(f3222,plain,
( $false
| ~ spl0_31 ),
inference(resolution,[],[f3165,f4]) ).
fof(f3226,plain,
~ spl0_31,
inference(avatar_contradiction_clause,[],[f3222]) ).
cnf(s11,plain,
~ spl0_2,
inference(sat_conversion,[],[f65]) ).
cnf(s13,plain,
( spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f405]) ).
cnf(s239,plain,
( spl0_2
| ~ spl0_4
| spl0_29 ),
inference(sat_conversion,[],[f3085]) ).
cnf(s251,plain,
( spl0_2
| ~ spl0_29
| spl0_31 ),
inference(sat_conversion,[],[f3166]) ).
cnf(s256,plain,
~ spl0_31,
inference(sat_conversion,[],[f3226]) ).
cnf(s257,plain,
( spl0_2
| ~ spl0_29 ),
inference(rat,[],[s251,s256]) ).
cnf(s258,plain,
~ spl0_29,
inference(rat,[],[s257,s11]) ).
cnf(s259,plain,
~ spl0_4,
inference(rat,[],[s239,s258,s11]) ).
cnf(s262,plain,
$false,
inference(rat,[],[s13,s259,s11]) ).
fof(f3227,plain,
$false,
inference(avatar_sat_refutation,[],[s262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL083-2 : TPTP v9.3.1. Bugfixed v1.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n012.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:20:50 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.37/0.49 % (2501667)Will run a generic schedule for satisfiability detection.
% 0.37/0.49 % (2501675)dis+10_1_sil=32000:sp=arity:random_seed=272075918:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.37/0.49 % (2501672)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1228699779_2999 on theBenchmark for (2999ds/0Mi)
% 0.37/0.49 % (2501676)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3912671536:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.37/0.49 % (2501678)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3468113021:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.37/0.49 % (2501677)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1244248785:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.37/0.49 % (2501674)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3285675474:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.37/0.49 % TRYING [1]
% 0.37/0.49 % TRYING [2]
% 0.37/0.49 % TRYING [3]
% 0.37/0.49 % TRYING [4]
% 0.37/0.49 % (2501673)% WARNING: option uhcvi not known.
% 0.37/0.49 % (2501673)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=513714804:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.37/0.49 % TRYING [5]
% 0.37/0.49 % (2501675) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2501667-2501675"...
% 0.37/0.49 % (2501675)...printing done.
% 0.37/0.49 % (2501675)Refutation found. Thanks to Tanya!
% 0.37/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.37/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.37/0.49 % (2501675)------------------------------
% 0.37/0.49 % (2501675)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.49 % (2501675)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.49 % (2501675)CaDiCaL version: 2.1.3
% 0.37/0.49 % (2501675)Termination reason: Refutation
% 0.37/0.49 % (2501675)Time elapsed: 0.042 s
% 0.37/0.49 % (2501675)Peak memory usage: 12 MB
% 0.37/0.49 % (2501675)Instructions burned: 81 (million)
% 0.37/0.49 % (2501667)Success in time 0.074 s
% 0.37/0.49 % Vampire exiting
%------------------------------------------------------------------------------