%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV486+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 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 : Fri Sep 25 03:22:22 PM UTC 2026
% Result : Theorem 4.10s 11.19s
% Output : CNFRefutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of formulae : 91 ( 26 unt; 1 def)
% Number of atoms : 324 ( 82 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 374 ( 151 ~; 155 |; 50 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 127 ( 0 sgn 120 !; 7 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( X0 = X1
| int_less(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( int_less(X1,X2)
& int_less(X0,X1) )
=> int_less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X2] :
( ( X1 = plus(X0,X2)
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X2)) = real_zero ) )
& ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(X3,X3) = real_one )
& ! [X2] :
( ( X0 = plus(X1,X2)
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(plus(X3,X2),X3) = real_zero ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qii) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0) )
=> a(X0,X1) = real_zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lt) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0) )
=> a(X0,X1) = real_zero ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X5] :
( ( plus(X0,X5) = X1
& int_less(int_zero,X5) )
=> ! [X6] :
( ( int_leq(X6,X0)
& int_leq(int_one,X6) )
=> real_zero = a(X6,plus(X6,X5)) ) )
& ! [X4] :
( ( int_leq(X4,X1)
& int_leq(int_one,X4) )
=> real_one = a(X4,X4) )
& ! [X2] :
( ( X0 = plus(X1,X2)
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(plus(X3,X2),X3) = real_zero ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(flattening,[],[f16]) ).
fof(f21,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ( ! [X5] :
( plus(X0,X5) != X1
| ~ int_less(int_zero,X5)
| ! [X6] :
( ~ int_leq(X6,X0)
| ~ int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) ) )
& ! [X4] :
( ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4)
| real_one = a(X4,X4) )
& ! [X2] :
( plus(X1,X2) != X0
| ~ int_less(int_zero,X2)
| ! [X3] :
( ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| a(plus(X3,X2),X3) = real_zero ) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ( ! [X5] :
( plus(X0,X5) != X1
| ~ int_less(int_zero,X5)
| ! [X6] :
( ~ int_leq(X6,X0)
| ~ int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) ) )
& ! [X4] :
( ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4)
| real_one = a(X4,X4) )
& ! [X2] :
( plus(X1,X2) != X0
| ~ int_less(int_zero,X2)
| ! [X3] :
( ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| a(plus(X3,X2),X3) = real_zero ) ) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
? [X0,X1] :
( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0)
& real_zero != a(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f24,plain,
? [X0,X1] :
( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0)
& real_zero != a(X0,X1) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) )
& ( ( X0 != X1
& ~ int_less(X0,X1) )
| int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( ( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) )
& ( ( X0 != X1
& ~ int_less(X0,X1) )
| int_leq(X0,X1) ) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( ~ int_less(X0,X1)
| ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 ) )
& ( ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 )
| int_less(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f28,plain,
! [X0,X1] :
( ( ~ int_less(X0,X1)
| ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 ) )
& ( ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 )
| int_less(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( ~ int_less(X0,X1)
| ( int_less(int_zero,sK0(X0,X1))
& plus(X0,sK0(X0,X1)) = X1 ) )
& ( ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 )
| int_less(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f28]) ).
fof(f30,plain,
! [X0] :
( ( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) )
& ( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f31,plain,
( int_leq(sK2,n)
& int_less(sK1,sK2)
& int_leq(int_one,sK1)
& real_zero != a(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f24]) ).
fof(f32,plain,
! [X0,X1] :
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f33,plain,
! [X0,X1] :
( X0 != X1
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f34,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f42,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_less(int_zero,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f29]) ).
fof(f43,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| plus(X0,sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f45,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f48,plain,
! [X0,X1,X6,X5] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| plus(X0,X5) != X1
| ~ int_less(int_zero,X5)
| ~ int_leq(X6,X0)
| ~ int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f51,plain,
int_leq(sK2,n),
inference(cnf_transformation,[],[f31]) ).
fof(f52,plain,
int_less(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
real_zero != a(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f55,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f33]) ).
fof(f59,plain,
! [X0,X6,X5] :
( ~ int_leq(plus(X0,X5),n)
| ~ int_leq(int_one,plus(X0,X5))
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_less(int_zero,X5)
| ~ int_leq(X6,X0)
| ~ int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) ),
inference(equality_resolution,[],[f48]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( int_leq(X0,X1)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_50,plain,
! [X0: $i] : int_leq(X0,X0),
inference(cnf_transformation,[],[f55]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( int_less(X0,X1)
| ( X0 = X1 )
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( ( plus(X0,sK0(X0,X1)) = X1 )
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( int_less(int_zero,sK0(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_62,plain,
! [X0: $i] :
( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_63,plain,
! [X0: $i] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( a(X2,plus(X2,X1)) = real_zero )
| ~ int_less(int_zero,X1)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(X2,X0)
| ~ int_leq(int_one,plus(X0,X1))
| ~ int_leq(plus(X0,X1),n) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_68,negated_conjecture,
a(sK1,sK2) != real_zero,
inference(cnf_transformation,[],[f54]) ).
tcf(c_69,negated_conjecture,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f53]) ).
tcf(c_70,negated_conjecture,
int_less(sK1,sK2),
inference(cnf_transformation,[],[f52]) ).
tcf(c_71,negated_conjecture,
int_leq(sK2,n),
inference(cnf_transformation,[],[f51]) ).
tcf(c_83,plain,
! [X0: $i] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
tcf(c_148,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( a(X2,plus(X2,X1)) = real_zero )
| ~ int_less(int_zero,X1)
| ~ int_less(int_zero,X0)
| ~ int_leq(int_one,X2)
| ~ int_leq(X0,n)
| ~ int_leq(X2,X0)
| ~ int_leq(int_one,plus(X0,X1))
| ~ int_leq(plus(X0,X1),n) ),
inference(bin_hyper_res,[status(thm)],[c_67,c_83]) ).
tcf(c_361,definition,
iPr_def_12 = a(sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_362,negated_conjecture,
int_leq(sK2,n),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_363,negated_conjecture,
int_less(sK1,sK2),
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_364,negated_conjecture,
int_leq(int_one,sK1),
inference(demodulation,[status(thm)],[c_69]) ).
tcf(c_365,negated_conjecture,
iPr_def_12 != real_zero,
inference(demodulation,[status(thm)],[c_68,c_361]) ).
tcf(c_366,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_370,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( int_less(X0,X2)
| ~ int_less(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_881,plain,
int_leq(sK1,sK2),
inference(superposition,[status(thm)],[c_363,c_49]) ).
tcf(c_897,plain,
int_less(int_zero,sK1),
inference(superposition,[status(thm)],[c_364,c_62]) ).
tcf(c_1014,plain,
( int_less(int_one,sK1)
| ( int_one = sK1 ) ),
inference(superposition,[status(thm)],[c_364,c_51]) ).
tcf(c_1015,plain,
( int_less(sK2,n)
| ( n = sK2 ) ),
inference(superposition,[status(thm)],[c_362,c_51]) ).
tcf(c_1216,plain,
! [X0: $i] :
( int_less(sK1,X0)
| ~ int_less(sK2,X0) ),
inference(superposition,[status(thm)],[c_363,c_52]) ).
tcf(c_1217,plain,
! [X0: $i] :
( int_less(int_zero,X0)
| ~ int_less(sK1,X0) ),
inference(superposition,[status(thm)],[c_897,c_52]) ).
tcf(c_1219,plain,
! [X0: $i] :
( int_less(int_one,X0)
| ( int_one = sK1 )
| ~ int_less(sK1,X0) ),
inference(superposition,[status(thm)],[c_1014,c_52]) ).
tcf(c_1268,plain,
( int_less(int_zero,sK0(sK1,sK2))
| ~ int_less(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_1278,plain,
plus(sK1,sK0(sK1,sK2)) = sK2,
inference(superposition,[status(thm)],[c_363,c_60]) ).
tcf(c_1375,plain,
( int_less(sK1,n)
| ( n = sK2 ) ),
inference(superposition,[status(thm)],[c_1015,c_1216]) ).
tcf(c_1431,plain,
! [X0: $i,X1: $i] :
( int_less(X0,X1)
| ~ int_less(sK1,sK2)
| ( X1 != sK2 )
| ( X0 != sK1 ) ),
inference(instantiation,[status(thm)],[c_370]) ).
tcf(c_1450,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK0(sK1,sK2))) = real_zero )
| ~ int_less(int_zero,sK1)
| ~ int_leq(sK2,n)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(int_one,plus(sK1,sK0(sK1,sK2))) ),
inference(superposition,[status(thm)],[c_1278,c_148]) ).
tcf(c_1474,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK0(sK1,sK2))) = real_zero )
| ~ int_less(int_zero,sK1)
| ~ int_leq(sK2,n)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2)) ),
inference(light_normalisation,[status(thm)],[c_1450,c_1278]) ).
tcf(c_1475,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK0(sK1,sK2))) = real_zero )
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1474,c_897,c_362]) ).
tcf(c_1588,plain,
! [X0: $i] :
( int_less(X0,sK2)
| ~ int_less(sK1,sK2)
| ( sK2 != sK2 )
| ( X0 != sK1 ) ),
inference(instantiation,[status(thm)],[c_1431]) ).
tcf(c_1589,plain,
sK2 = sK2,
inference(instantiation,[status(thm)],[c_366]) ).
tcf(c_1590,plain,
( int_less(int_one,sK2)
| ~ int_less(sK1,sK2)
| ( sK2 != sK2 )
| ( int_one != sK1 ) ),
inference(instantiation,[status(thm)],[c_1588]) ).
tcf(c_1610,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK0(sK1,sK2))) = real_zero )
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1) ),
inference(global_subsumption_just,[status(thm)],[c_1475,c_70,c_1268,c_1475]) ).
tcf(c_1759,plain,
int_less(int_zero,sK2),
inference(superposition,[status(thm)],[c_363,c_1217]) ).
tcf(c_1796,plain,
int_leq(int_one,sK2),
inference(superposition,[status(thm)],[c_1759,c_63]) ).
tcf(c_1800,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK0(sK1,sK2))) = real_zero )
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1610,c_1796]) ).
tcf(c_1945,plain,
( int_leq(sK1,n)
| ( n = sK2 ) ),
inference(superposition,[status(thm)],[c_1375,c_49]) ).
tcf(c_2087,plain,
( int_less(int_one,sK2)
| ( int_one = sK1 ) ),
inference(superposition,[status(thm)],[c_363,c_1219]) ).
tcf(c_2154,plain,
int_less(int_one,sK2),
inference(global_subsumption_just,[status(thm)],[c_2087,c_70,c_1590,c_1589,c_2087]) ).
tcf(c_3660,plain,
( ( a(sK1,plus(sK1,sK0(sK1,sK2))) = real_zero )
| ~ int_leq(sK1,sK1)
| ~ int_leq(sK1,n) ),
inference(superposition,[status(thm)],[c_364,c_1800]) ).
tcf(c_3676,plain,
( ( real_zero = iPr_def_12 )
| ~ int_leq(sK1,sK1)
| ~ int_leq(sK1,n) ),
inference(light_normalisation,[status(thm)],[c_3660,c_361,c_1278]) ).
tcf(c_3677,plain,
( ( real_zero = iPr_def_12 )
| ~ int_leq(sK1,n) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3676,c_50]) ).
tcf(c_4095,plain,
( ( n = sK2 )
| ( real_zero = iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_1945,c_3677]) ).
tcf(c_4308,plain,
( int_less(int_one,n)
| ( real_zero = iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_4095,c_2154]) ).
tcf(c_4322,plain,
( int_leq(sK1,n)
| ( real_zero = iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_4095,c_881]) ).
tcf(c_4580,plain,
real_zero = iPr_def_12,
inference(global_subsumption_just,[status(thm)],[c_4308,c_3677,c_4322]) ).
tcf(c_4596,plain,
iPr_def_12 != iPr_def_12,
inference(demodulation,[status(thm)],[c_365,c_4580]) ).
tcf(c_4597,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_4596]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV486+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/10.37 % Computer : n010.cluster.edu
% 0.10/10.37 % Model : x86_64 x86_64
% 0.10/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.37 % Memory : 8046.5625MB
% 0.10/10.37 % OS : Linux 6.8.0-71-generic
% 0.10/10.37 % CPULimit : 300
% 0.10/10.37 % WCLimit : 300
% 0.10/10.37 % DateTime : Thu Sep 24 19:54:41 UTC 2026
% 0.10/10.37 % CPUTime :
% 0.10/10.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.41 Running first-order theorem proving
% 0.14/10.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/10.42
% 0.14/10.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.42
% 0.14/10.42 % Detected problem language: tptp
% 0.14/10.43 % Proving...
% 4.10/11.19 % SZS status Started for theBenchmark.p
% 4.10/11.19 % SZS status Theorem for theBenchmark.p
% 4.10/11.19
% 4.10/11.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.10/11.19
% 4.10/11.19 % ------ iProver source info
% 4.10/11.19
% 4.10/11.19 % git: date: 2026-07-19 20:42:38 +0200
% 4.10/11.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.10/11.19 % git: non_committed_changes: false
% 4.10/11.19
% 4.10/11.19 % ------ Parsing...
% 4.10/11.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.10/11.19
% 4.10/11.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.10/11.19
% 4.10/11.19 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.10/11.19
% 4.10/11.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.10/11.19 % ------ Proving...
% 4.10/11.19 % ------ Problem Properties
% 4.10/11.19
% 4.10/11.19 %
% 4.10/11.19 % clauses 26
% 4.10/11.19 % conjectures 4
% 4.10/11.19 % EPR 16
% 4.10/11.19 % Horn 23
% 4.10/11.19 % unary 11
% 4.10/11.19 % binary 8
% 4.10/11.19 % lits 61
% 4.10/11.19 % lits eq 10
% 4.10/11.19 % fd_pure 0
% 4.10/11.19 % fd_pseudo 0
% 4.10/11.19 % fd_cond 0
% 4.10/11.19 % fd_pseudo_cond 1
% 4.10/11.19 % AC symbols 0
% 4.10/11.19
% 4.10/11.19 % ------ Schedule dynamic 5 is on
% 4.10/11.19
% 4.10/11.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.10/11.19
% 4.10/11.19
% 4.10/11.19 % ------
% 4.10/11.19 % Current options:
% 4.10/11.19 % ------
% 4.10/11.19
% 4.10/11.19
% 4.10/11.19 %
% 4.10/11.19
% 4.10/11.19 % ------ Proving...
% 4.10/11.19 %
% 4.10/11.19
% 4.10/11.19 % SZS status Theorem for theBenchmark.p
% 4.10/11.19
% 4.10/11.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.10/11.20
% 4.10/11.20
%------------------------------------------------------------------------------