%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL024-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:50:57 AM UTC 2026
% Result : Unsatisfiable 11.44s 2.26s
% Output : Refutation 12.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 47
% Number of leaves : 19
% Syntax : Number of formulae : 118 ( 81 unt; 15 def)
% Number of atoms : 180 ( 92 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 120 ( 58 ~; 53 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 10 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-4 aty)
% Number of variables : 155 ( 0 sgn 155 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0,X1] : ifeq(is_a_theorem(equivalent(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f3,plain,
! [X0,X1] : true = ifeq(is_a_theorem(equivalent(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xgk) ).
fof(f5,plain,
! [X2,X0,X1] : true = is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1)))),
inference(reorient_equations,[],[f4]) ).
fof(f6,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_pyo) ).
fof(f7,plain,
true != is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
inference(reorient_equations,[],[f6]) ).
fof(f8,definition,
sF0 = equivalent(b,c),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f9,plain,
equivalent(b,c) = sF0,
inference(reorient_equations,[],[f8]) ).
fof(f10,definition,
sF1 = equivalent(a,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f11,plain,
equivalent(a,sF0) = sF1,
inference(reorient_equations,[],[f10]) ).
fof(f12,definition,
sF2 = equivalent(sF1,c),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f13,plain,
equivalent(sF1,c) = sF2,
inference(reorient_equations,[],[f12]) ).
fof(f14,definition,
sF3 = equivalent(b,a),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f15,plain,
equivalent(b,a) = sF3,
inference(reorient_equations,[],[f14]) ).
fof(f16,definition,
sF4 = equivalent(sF2,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f17,plain,
equivalent(sF2,sF3) = sF4,
inference(reorient_equations,[],[f16]) ).
fof(f18,definition,
sF5 = is_a_theorem(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f19,plain,
is_a_theorem(sF4) = sF5,
inference(reorient_equations,[],[f18]) ).
fof(f20,plain,
true != sF5,
inference(definition_folding,[],[f7,f19,f17,f15,f13,f11,f9]) ).
fof(f22,definition,
( spl6_1
<=> is_a_theorem(sF4) = sF5 ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f24,plain,
( is_a_theorem(sF4) = sF5
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f25,plain,
spl6_1,
inference(avatar_split_clause,[],[f19,f22]) ).
fof(f26,plain,
( ! [X0] : true = ifeq(is_a_theorem(equivalent(X0,sF4)),true,ifeq(is_a_theorem(X0),true,sF5,true),true)
| ~ spl6_1 ),
inference(superposition,[],[f3,f24]) ).
fof(f28,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(X0),true,is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1))),true),true),
inference(superposition,[],[f3,f5]) ).
fof(f30,plain,
! [X2,X3,X0,X1] : true = ifeq(is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1))),X3)),true,ifeq(true,true,is_a_theorem(X3),true),true),
inference(superposition,[],[f3,f5]) ).
fof(f31,plain,
! [X2,X3,X0,X1] : true = ifeq(is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1))),X3)),true,is_a_theorem(X3),true),
inference(forward_demodulation,[],[f30,f1]) ).
fof(f32,plain,
! [X2,X0,X1] : true = ifeq(is_a_theorem(X0),true,is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1))),true),
inference(forward_demodulation,[],[f28,f1]) ).
fof(f34,definition,
( spl6_2
<=> equivalent(a,sF0) = sF1 ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f36,plain,
( equivalent(a,sF0) = sF1
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f37,plain,
spl6_2,
inference(avatar_split_clause,[],[f11,f34]) ).
fof(f42,definition,
( spl6_3
<=> equivalent(sF2,sF3) = sF4 ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f44,plain,
( equivalent(sF2,sF3) = sF4
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f45,plain,
spl6_3,
inference(avatar_split_clause,[],[f17,f42]) ).
fof(f47,definition,
( spl6_4
<=> equivalent(b,c) = sF0 ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f49,plain,
( equivalent(b,c) = sF0
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f50,plain,
spl6_4,
inference(avatar_split_clause,[],[f9,f47]) ).
fof(f55,definition,
( spl6_5
<=> equivalent(b,a) = sF3 ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f57,plain,
( equivalent(b,a) = sF3
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f58,plain,
spl6_5,
inference(avatar_split_clause,[],[f15,f55]) ).
fof(f63,definition,
( spl6_6
<=> equivalent(sF1,c) = sF2 ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f65,plain,
( equivalent(sF1,c) = sF2
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f66,plain,
spl6_6,
inference(avatar_split_clause,[],[f13,f63]) ).
fof(f68,definition,
( spl6_7
<=> true = sF5 ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f70,plain,
( true != sF5
| spl6_7 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f71,plain,
~ spl6_7,
inference(avatar_split_clause,[],[f20,f68]) ).
fof(f89,plain,
! [X2,X3,X0,X1,X4] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(X3,equivalent(X4,equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1))))),equivalent(X4,X3))),true),
inference(superposition,[],[f31,f5]) ).
fof(f93,plain,
! [X2,X3,X0,X1,X4] : true = is_a_theorem(equivalent(equivalent(X3,equivalent(X4,equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1))))),equivalent(X4,X3))),
inference(forward_demodulation,[],[f89,f1]) ).
fof(f130,plain,
! [X2,X3,X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)),equivalent(X3,X0)),X0)),true),
inference(superposition,[],[f31,f93]) ).
fof(f131,plain,
! [X2,X3,X0,X1,X4] : true = ifeq(true,true,ifeq(is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X4,X2)),equivalent(X4,X3)))))),true,is_a_theorem(equivalent(X1,X0)),true),true),
inference(superposition,[],[f3,f93]) ).
fof(f138,plain,
! [X2,X3,X0,X1,X4] : true = ifeq(is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X4,X2)),equivalent(X4,X3)))))),true,is_a_theorem(equivalent(X1,X0)),true),
inference(forward_demodulation,[],[f131,f1]) ).
fof(f139,plain,
! [X2,X3,X0,X1] : true = is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)),equivalent(X3,X0)),X0)),
inference(forward_demodulation,[],[f130,f1]) ).
fof(f187,plain,
! [X2,X3,X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,X0)),equivalent(X2,X3))),true,is_a_theorem(X3),true),true),
inference(superposition,[],[f3,f139]) ).
fof(f200,plain,
! [X2,X3,X0,X1] : true = ifeq(is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,X0)),equivalent(X2,X3))),true,is_a_theorem(X3),true),
inference(forward_demodulation,[],[f187,f1]) ).
fof(f224,plain,
! [X1] : true = ifeq(true,true,is_a_theorem(equivalent(X1,X1)),true),
inference(superposition,[],[f200,f139]) ).
fof(f231,plain,
! [X1] : true = is_a_theorem(equivalent(X1,X1)),
inference(forward_demodulation,[],[f224,f1]) ).
fof(f246,plain,
! [X2,X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X0,X0))),equivalent(X2,X1))),true),
inference(superposition,[],[f32,f231]) ).
fof(f248,plain,
! [X2,X0,X1] : true = is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X0,X0))),equivalent(X2,X1))),
inference(forward_demodulation,[],[f246,f1]) ).
fof(f278,plain,
! [X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X0)),X0)),true),
inference(superposition,[],[f31,f248]) ).
fof(f299,plain,
! [X0,X1] : true = is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X0)),X0)),
inference(forward_demodulation,[],[f278,f1]) ).
fof(f329,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(equivalent(X0,equivalent(X0,X1))),true,is_a_theorem(X1),true),true),
inference(superposition,[],[f3,f299]) ).
fof(f330,plain,
! [X2,X3,X0,X1,X4] : true = ifeq(true,true,is_a_theorem(equivalent(X1,equivalent(X0,equivalent(X0,equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X4,X2)),equivalent(X4,X3)))))))),true),
inference(superposition,[],[f138,f299]) ).
fof(f344,plain,
! [X2,X3,X0,X1,X4] : true = is_a_theorem(equivalent(X1,equivalent(X0,equivalent(X0,equivalent(X1,equivalent(X2,equivalent(equivalent(X3,equivalent(X4,X2)),equivalent(X4,X3)))))))),
inference(forward_demodulation,[],[f330,f1]) ).
fof(f345,plain,
! [X0,X1] : true = ifeq(is_a_theorem(equivalent(X0,equivalent(X0,X1))),true,is_a_theorem(X1),true),
inference(forward_demodulation,[],[f329,f1]) ).
fof(f730,plain,
! [X2,X3,X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(X3,equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,X0)),equivalent(X2,X3)))),true),
inference(superposition,[],[f138,f344]) ).
fof(f771,plain,
! [X2,X3,X0,X1] : true = is_a_theorem(equivalent(X3,equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,X0)),equivalent(X2,X3)))),
inference(forward_demodulation,[],[f730,f1]) ).
fof(f1064,plain,
! [X2,X3,X0,X1,X4] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(X3,equivalent(X4,X2)),equivalent(X4,X3)),equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,X0)))),true),
inference(superposition,[],[f138,f771]) ).
fof(f1107,plain,
! [X2,X3,X0,X1,X4] : true = is_a_theorem(equivalent(equivalent(equivalent(X3,equivalent(X4,X2)),equivalent(X4,X3)),equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,X0)))),
inference(forward_demodulation,[],[f1064,f1]) ).
fof(f1137,plain,
! [X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(X1,equivalent(X0,equivalent(X1,X0)))),true),
inference(superposition,[],[f345,f1107]) ).
fof(f1162,plain,
! [X0,X1] : true = is_a_theorem(equivalent(X1,equivalent(X0,equivalent(X1,X0)))),
inference(forward_demodulation,[],[f1137,f1]) ).
fof(f1171,plain,
( true = is_a_theorem(equivalent(sF2,equivalent(sF3,sF4)))
| ~ spl6_3 ),
inference(superposition,[],[f1162,f44]) ).
fof(f1192,plain,
! [X2,X3,X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(X2,equivalent(X3,equivalent(X0,equivalent(X1,equivalent(X0,X1))))),equivalent(X3,X2))),true),
inference(superposition,[],[f32,f1162]) ).
fof(f1202,plain,
! [X2,X3,X0,X1] : true = is_a_theorem(equivalent(equivalent(X2,equivalent(X3,equivalent(X0,equivalent(X1,equivalent(X0,X1))))),equivalent(X3,X2))),
inference(forward_demodulation,[],[f1192,f1]) ).
fof(f1859,definition,
( spl6_22
<=> true = is_a_theorem(equivalent(sF2,equivalent(sF3,sF4))) ),
introduced(definition,[new_symbols(definition,[spl6_22])],[avatar_definition]) ).
fof(f1861,plain,
( true = is_a_theorem(equivalent(sF2,equivalent(sF3,sF4)))
| ~ spl6_22 ),
inference(avatar_component_clause,[],[f1859]) ).
fof(f1862,plain,
( spl6_22
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f1171,f42,f1859]) ).
fof(f1868,plain,
( true = ifeq(is_a_theorem(equivalent(equivalent(sF2,equivalent(sF3,sF4)),sF4)),true,ifeq(true,true,sF5,true),true)
| ~ spl6_1
| ~ spl6_22 ),
inference(superposition,[],[f26,f1861]) ).
fof(f1884,plain,
( true = ifeq(is_a_theorem(equivalent(equivalent(sF2,equivalent(sF3,sF4)),sF4)),true,sF5,true)
| ~ spl6_1
| ~ spl6_22 ),
inference(forward_demodulation,[],[f1868,f1]) ).
fof(f2101,plain,
! [X2,X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X1)),equivalent(X2,X0)),X0)),true),
inference(superposition,[],[f31,f1202]) ).
fof(f2144,plain,
! [X2,X0,X1] : true = is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X1)),equivalent(X2,X0)),X0)),
inference(forward_demodulation,[],[f2101,f1]) ).
fof(f2165,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),equivalent(X1,X2))),true,is_a_theorem(X2),true),true),
inference(superposition,[],[f3,f2144]) ).
fof(f2196,plain,
! [X2,X0,X1] : true = ifeq(is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),equivalent(X1,X2))),true,is_a_theorem(X2),true),
inference(forward_demodulation,[],[f2165,f1]) ).
fof(f2282,plain,
! [X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X1)),true),
inference(superposition,[],[f2196,f1162]) ).
fof(f2336,plain,
! [X0,X1] : true = is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X1)),
inference(forward_demodulation,[],[f2282,f1]) ).
fof(f2354,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(equivalent(X0,equivalent(X1,X0))),true,is_a_theorem(X1),true),true),
inference(superposition,[],[f3,f2336]) ).
fof(f2386,plain,
! [X0,X1] : true = ifeq(is_a_theorem(equivalent(X0,equivalent(X1,X0))),true,is_a_theorem(X1),true),
inference(forward_demodulation,[],[f2354,f1]) ).
fof(f2411,plain,
! [X2,X0,X1] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(X1,X0),equivalent(equivalent(X0,equivalent(X1,X2)),X2))),true),
inference(superposition,[],[f2386,f1107]) ).
fof(f2463,plain,
! [X2,X0,X1] : true = is_a_theorem(equivalent(equivalent(X1,X0),equivalent(equivalent(X0,equivalent(X1,X2)),X2))),
inference(forward_demodulation,[],[f2411,f1]) ).
fof(f2484,plain,
( ! [X0] : true = is_a_theorem(equivalent(equivalent(b,X0),equivalent(equivalent(X0,sF0),c)))
| ~ spl6_4 ),
inference(superposition,[],[f2463,f49]) ).
fof(f2498,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(is_a_theorem(equivalent(X0,X1)),true,is_a_theorem(equivalent(equivalent(X1,equivalent(X0,X2)),X2)),true),true),
inference(superposition,[],[f3,f2463]) ).
fof(f2521,plain,
! [X2,X0,X1] : true = ifeq(is_a_theorem(equivalent(X0,X1)),true,is_a_theorem(equivalent(equivalent(X1,equivalent(X0,X2)),X2)),true),
inference(forward_demodulation,[],[f2498,f1]) ).
fof(f2787,plain,
( true = is_a_theorem(equivalent(equivalent(b,a),equivalent(sF1,c)))
| ~ spl6_2
| ~ spl6_4 ),
inference(superposition,[],[f2484,f36]) ).
fof(f2820,plain,
( true = is_a_theorem(equivalent(equivalent(b,a),sF2))
| ~ spl6_2
| ~ spl6_4
| ~ spl6_6 ),
inference(forward_demodulation,[],[f2787,f65]) ).
fof(f2822,plain,
( true = is_a_theorem(equivalent(sF3,sF2))
| ~ spl6_2
| ~ spl6_4
| ~ spl6_5
| ~ spl6_6 ),
inference(forward_demodulation,[],[f2820,f57]) ).
fof(f2825,definition,
( spl6_26
<=> true = is_a_theorem(equivalent(sF3,sF2)) ),
introduced(definition,[new_symbols(definition,[spl6_26])],[avatar_definition]) ).
fof(f2827,plain,
( true = is_a_theorem(equivalent(sF3,sF2))
| ~ spl6_26 ),
inference(avatar_component_clause,[],[f2825]) ).
fof(f2828,plain,
( spl6_26
| ~ spl6_2
| ~ spl6_4
| ~ spl6_5
| ~ spl6_6 ),
inference(avatar_split_clause,[],[f2822,f63,f55,f47,f34,f2825]) ).
fof(f2829,plain,
( ! [X0] : true = ifeq(true,true,is_a_theorem(equivalent(equivalent(sF2,equivalent(sF3,X0)),X0)),true)
| ~ spl6_26 ),
inference(superposition,[],[f2521,f2827]) ).
fof(f2856,plain,
( ! [X0] : true = is_a_theorem(equivalent(equivalent(sF2,equivalent(sF3,X0)),X0))
| ~ spl6_26 ),
inference(forward_demodulation,[],[f2829,f1]) ).
fof(f2857,plain,
( true = ifeq(true,true,sF5,true)
| ~ spl6_1
| ~ spl6_22
| ~ spl6_26 ),
inference(backward_demodulation,[],[f1884,f2856]) ).
fof(f2858,plain,
( true = sF5
| ~ spl6_1
| ~ spl6_22
| ~ spl6_26 ),
inference(forward_demodulation,[],[f2857,f1]) ).
fof(f2859,plain,
( $false
| ~ spl6_1
| spl6_7
| ~ spl6_22
| ~ spl6_26 ),
inference(forward_subsumption_resolution,[],[f2858,f70]) ).
fof(f2860,plain,
( ~ spl6_1
| spl6_7
| ~ spl6_22
| ~ spl6_26 ),
inference(avatar_contradiction_clause,[],[f2859]) ).
cnf(s1,plain,
spl6_1,
inference(sat_conversion,[],[f25]) ).
cnf(s2,plain,
spl6_2,
inference(sat_conversion,[],[f37]) ).
cnf(s3,plain,
spl6_3,
inference(sat_conversion,[],[f45]) ).
cnf(s4,plain,
spl6_4,
inference(sat_conversion,[],[f50]) ).
cnf(s5,plain,
spl6_5,
inference(sat_conversion,[],[f58]) ).
cnf(s6,plain,
spl6_6,
inference(sat_conversion,[],[f66]) ).
cnf(s7,plain,
~ spl6_7,
inference(sat_conversion,[],[f71]) ).
cnf(s22,plain,
( ~ spl6_3
| spl6_22 ),
inference(sat_conversion,[],[f1862]) ).
cnf(s26,plain,
( ~ spl6_2
| ~ spl6_4
| ~ spl6_5
| ~ spl6_6
| spl6_26 ),
inference(sat_conversion,[],[f2828]) ).
cnf(s27,plain,
( ~ spl6_1
| spl6_7
| ~ spl6_22
| ~ spl6_26 ),
inference(sat_conversion,[],[f2860]) ).
cnf(s38,plain,
spl6_22,
inference(rat,[],[s22,s3]) ).
cnf(s39,plain,
spl6_26,
inference(rat,[],[s26,s4,s6,s5,s2]) ).
cnf(s45,plain,
~ spl6_1,
inference(rat,[],[s27,s38,s7,s39]) ).
cnf(s46,plain,
$false,
inference(rat,[],[s1,s45]) ).
fof(f2861,plain,
$false,
inference(avatar_sat_refutation,[],[s46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL024-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 15:15:40 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 11.44/2.26 % (1569975)Detected a unit-equality problem, will run specialized UEQ schedule.
% 11.44/2.26 % (1569986)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3032274621:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 11.44/2.26 % (1569985)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2620306005:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 11.44/2.26 % (1569980)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=3143987517:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 11.44/2.26 % (1569982)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4209096373:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 11.44/2.26 % (1569981)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3234746730:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 11.44/2.26 % (1569984)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=382655484:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 11.44/2.26 % (1569983)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1134971099:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 11.44/2.26 % (1569983)Instruction limit reached!
% 11.44/2.26 % (1569983)------------------------------
% 11.44/2.26 % (1569983)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.44/2.26 % (1569983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.44/2.26 % (1569983)CaDiCaL version: 2.1.3
% 11.44/2.26 % (1569983)Termination reason: Instruction limit
% 11.44/2.26 % (1569983)Termination phase: Saturation
% 11.44/2.26 % (1569983)Time elapsed: 0.080 s
% 11.44/2.26 % (1569983)Peak memory usage: 89 MB
% 11.44/2.26 % (1569983)Instructions burned: 138 (million)
% 11.44/2.26 % (1569984)Instruction limit reached!
% 11.44/2.26 % (1569984)------------------------------
% 11.44/2.26 % (1569984)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.44/2.26 % (1569984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.44/2.26 % (1569984)CaDiCaL version: 2.1.3
% 11.44/2.26 % (1569984)Termination reason: Instruction limit
% 11.44/2.26 % (1569984)Termination phase: Saturation
% 11.44/2.26 % (1569984)Time elapsed: 0.092 s
% 11.44/2.26 % (1569984)Peak memory usage: 89 MB
% 11.44/2.26 % (1569984)Instructions burned: 183 (million)
% 11.44/2.26 % (1569985)Instruction limit reached!
% 11.44/2.26 % (1569985)------------------------------
% 11.44/2.26 % (1569985)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.44/2.26 % (1569985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.44/2.26 % (1569985)CaDiCaL version: 2.1.3
% 11.44/2.26 % (1569985)Termination reason: Instruction limit
% 11.44/2.26 % (1569985)Termination phase: Saturation
% 11.44/2.26 % (1569985)Time elapsed: 0.110 s
% 11.44/2.26 % (1569985)Peak memory usage: 90 MB
% 11.44/2.26 % (1569985)Instructions burned: 260 (million)
% 11.44/2.26 % (1569996)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=127473252:i=215:ep=RSTC_2997 on theBenchmark for (2997ds/215Mi)
% 11.44/2.26 % (1569995)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=4082286037:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 11.44/2.26 % (1569994)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=835259913:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 11.44/2.26 % (1569996)Instruction limit reached!
% 11.44/2.26 % (1569996)------------------------------
% 11.44/2.26 % (1569996)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.44/2.26 % (1569996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.44/2.26 % (1569996)CaDiCaL version: 2.1.3
% 11.44/2.26 % (1569996)Termination reason: Instruction limit
% 11.44/2.26 % (1569996)Termination phase: Saturation
% 11.44/2.26 % (1569996)Time elapsed: 0.063 s
% 11.44/2.26 % (1569996)Peak memory usage: 88 MB
% 11.44/2.26 % (1569996)Instructions burned: 226 (million)
% 11.44/2.26 % (1570000)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=1507118643:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2996 on theBenchmark for (2996ds/317Mi)
% 11.44/2.26 % (1570000)Instruction limit reached!
% 11.44/2.26 % (1570000)------------------------------
% 11.44/2.26 % (1570000)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.44/2.26 % (1570000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.44/2.26 % (1570000)CaDiCaL version: 2.1.3
% 11.44/2.26 % (1570000)Termination reason: Instruction limit
% 11.44/2.26 % (1570000)Termination phase: Saturation
% 11.44/2.26 % (1570000)Time elapsed: 0.097 s
% 11.44/2.26 % (1570000)Peak memory usage: 94 MB
% 11.44/2.26 % (1570000)Instructions burned: 319 (million)
% 11.44/2.26 % (1570002)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=1956390881:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2994 on theBenchmark for (2994ds/12125Mi)
% 11.44/2.26 % (1569986)Instruction limit reached!
% 11.44/2.26 % (1569986)------------------------------
% 11.44/2.26 % (1569986)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.44/2.26 % (1569986)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.44/2.26 % (1569986)CaDiCaL version: 2.1.3
% 11.44/2.26 % (1569986)Termination reason: Instruction limit
% 11.44/2.26 % (1569986)Termination phase: Saturation
% 11.44/2.26 % (1569986)Time elapsed: 0.655 s
% 11.44/2.26 % (1569986)Peak memory usage: 97 MB
% 11.44/2.26 % (1569986)Instructions burned: 1188 (million)
% 11.44/2.26 % (1570004)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=784294771:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2992 on theBenchmark for (2992ds/2836Mi)
% 11.44/2.26 % (1569980)First to succeed.
% 11.44/2.26 % (1569980)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1569975"
% 11.44/2.26 % (1570002)Also succeeded, but the first one will report.
% 11.44/2.26 % (1569994)Instruction limit reached!
% 11.44/2.26 % (1569994)------------------------------
% 11.44/2.26 % (1569994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.44/2.26 % (1569994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.44/2.26 % (1569994)CaDiCaL version: 2.1.3
% 11.44/2.26 % (1569994)Termination reason: Instruction limit
% 11.44/2.26 % (1569994)Termination phase: Saturation
% 11.44/2.26 % (1569994)Time elapsed: 1.267 s
% 11.44/2.26 % (1569994)Peak memory usage: 140 MB
% 11.44/2.26 % (1569994)Instructions burned: 2052 (million)
% 11.44/2.26 % (1569980)Refutation found. Thanks to Tanya!
% 11.44/2.26 % SZS status Unsatisfiable for theBenchmark
% 11.44/2.26 % SZS output start Proof for theBenchmark
% See solution above
% 12.08/2.44 % (1569980)------------------------------
% 12.08/2.44 % (1569980)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.08/2.44 % (1569980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.08/2.44 % (1569980)CaDiCaL version: 2.1.3
% 12.08/2.44 % (1569980)Termination reason: Refutation
% 12.08/2.44 % (1569980)Time elapsed: 1.255 s
% 12.08/2.44 % (1569980)Peak memory usage: 139 MB
% 12.08/2.44 % (1569980)Instructions burned: 2049 (million)
% 12.08/2.44 % (1569980)------------------------------
% 12.08/2.44 % (1569980)------------------------------
% 12.08/2.44 % (1569975)Success in time 1.654 s
% 12.08/2.44 % Vampire exiting
%------------------------------------------------------------------------------