TSTP Solution File: SWV487+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV487+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:17:30 EDT 2024
% Result : Theorem 10.29s 2.12s
% Output : CNFRefutation 10.29s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% 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(f4,axiom,
! [X0,X1] :
( int_leq(X1,X0)
| int_less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_total) ).
fof(f7,axiom,
! [X0] : plus(X0,int_zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_zero) ).
fof(f8,axiom,
! [X3,X4,X5,X6] :
( ( int_leq(X5,X6)
& int_less(X3,X4) )
=> int_leq(plus(X3,X5),plus(X4,X6)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_order1) ).
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) )
=> ( ! [X7] :
( ( plus(X0,X7) = X1
& int_leq(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X0)
& int_leq(int_one,X2) )
=> a(X2,plus(X2,X7)) = lu(X2,plus(X2,X7)) ) )
& ! [X7] :
( ( plus(X1,X7) = X0
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_zero = a(plus(X2,X7),X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qiu) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) )
=> real_zero = a(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ut) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) )
=> real_zero = a(X0,X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( ( int_leq(X2,X3)
& int_less(X0,X1) )
=> int_leq(plus(X0,X2),plus(X1,X3)) ),
inference(rectify,[],[f8]) ).
fof(f16,plain,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X2] :
( ( plus(X0,X2) = X1
& int_leq(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2)) ) )
& ! [X4] :
( ( plus(X1,X4) = X0
& int_less(int_zero,X4) )
=> ! [X5] :
( ( int_leq(X5,X1)
& int_leq(int_one,X5) )
=> real_zero = a(plus(X5,X4),X5) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f17,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f18,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(flattening,[],[f17]) ).
fof(f20,plain,
! [X0,X1,X2,X3] :
( int_leq(plus(X0,X2),plus(X1,X3))
| ~ int_leq(X2,X3)
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
! [X0,X1,X2,X3] :
( int_leq(plus(X0,X2),plus(X1,X3))
| ~ int_leq(X2,X3)
| ~ int_less(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_leq(int_zero,X2) )
& ! [X4] :
( ! [X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5) )
| plus(X1,X4) != X0
| ~ int_less(int_zero,X4) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f23,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_leq(int_zero,X2) )
& ! [X4] :
( ! [X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5) )
| plus(X1,X4) != X0
| ~ int_less(int_zero,X4) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f25,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) ),
inference(flattening,[],[f24]) ).
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(nnf_transformation,[],[f1]) ).
fof(f27,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,[],[f26]) ).
fof(f28,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(f29,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 )
| ~ int_less(X0,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 )
=> ( int_less(int_zero,sK0(X0,X1))
& plus(X0,sK0(X0,X1)) = X1 ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ( int_less(int_zero,sK0(X0,X1))
& plus(X0,sK0(X0,X1)) = X1 )
| ~ int_less(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f29,f30]) ).
fof(f32,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(f33,plain,
( ? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) )
=> ( real_zero != a(sK1,sK2)
& int_leq(sK1,n)
& int_less(sK2,sK1)
& int_leq(int_one,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
( real_zero != a(sK1,sK2)
& int_leq(sK1,n)
& int_less(sK2,sK1)
& int_leq(int_one,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f25,f33]) ).
fof(f35,plain,
! [X0,X1] :
( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f36,plain,
! [X0,X1] :
( int_leq(X0,X1)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f37,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f38,plain,
! [X2,X0,X1] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f40,plain,
! [X0,X1] :
( int_leq(X1,X0)
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f43,plain,
! [X0] : plus(X0,int_zero) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f44,plain,
! [X2,X3,X0,X1] :
( int_leq(plus(X0,X2),plus(X1,X3))
| ~ int_leq(X2,X3)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f45,plain,
! [X0,X1] :
( plus(X0,sK0(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f46,plain,
! [X0,X1] :
( int_less(int_zero,sK0(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f48,plain,
! [X0] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f49,plain,
! [X0] :
( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f51,plain,
! [X0,X1,X4,X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5)
| plus(X1,X4) != X0
| ~ int_less(int_zero,X4)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f53,plain,
int_leq(int_one,sK2),
inference(cnf_transformation,[],[f34]) ).
fof(f54,plain,
int_less(sK2,sK1),
inference(cnf_transformation,[],[f34]) ).
fof(f55,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f34]) ).
fof(f56,plain,
real_zero != a(sK1,sK2),
inference(cnf_transformation,[],[f34]) ).
fof(f57,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f37]) ).
fof(f61,plain,
! [X1,X4,X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5)
| ~ int_less(int_zero,X4)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(plus(X1,X4),n)
| ~ int_leq(int_one,plus(X1,X4)) ),
inference(equality_resolution,[],[f51]) ).
cnf(c_49,plain,
int_leq(X0,X0),
inference(cnf_transformation,[],[f57]) ).
cnf(c_50,plain,
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_51,plain,
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_52,plain,
( ~ int_less(X0,X1)
| ~ int_less(X2,X0)
| int_less(X2,X1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_54,plain,
( int_leq(X0,X1)
| int_less(X1,X0) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_57,plain,
plus(X0,int_zero) = X0,
inference(cnf_transformation,[],[f43]) ).
cnf(c_58,plain,
( ~ int_leq(X0,X1)
| ~ int_less(X2,X3)
| int_leq(plus(X2,X0),plus(X3,X1)) ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_60,plain,
( ~ int_less(X0,X1)
| int_less(int_zero,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_61,plain,
( ~ int_less(X0,X1)
| plus(X0,sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_62,plain,
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_63,plain,
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_66,plain,
( ~ int_leq(plus(X0,X1),n)
| ~ int_leq(int_one,plus(X0,X1))
| ~ int_leq(X2,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(int_one,X2)
| ~ int_less(int_zero,X1)
| a(plus(X2,X1),X2) = real_zero ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_67,negated_conjecture,
a(sK1,sK2) != real_zero,
inference(cnf_transformation,[],[f56]) ).
cnf(c_68,negated_conjecture,
int_leq(sK1,n),
inference(cnf_transformation,[],[f55]) ).
cnf(c_69,negated_conjecture,
int_less(sK2,sK1),
inference(cnf_transformation,[],[f54]) ).
cnf(c_70,negated_conjecture,
int_leq(int_one,sK2),
inference(cnf_transformation,[],[f53]) ).
cnf(c_81,plain,
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
cnf(c_142,plain,
( ~ int_leq(plus(X0,X1),n)
| ~ int_leq(int_one,plus(X0,X1))
| ~ int_leq(X2,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X2)
| ~ int_less(int_zero,X0)
| ~ int_less(int_zero,X1)
| a(plus(X2,X1),X2) = real_zero ),
inference(bin_hyper_res,[status(thm)],[c_66,c_81]) ).
cnf(c_325,plain,
a(sK1,sK2) = sP0_iProver_def,
definition ).
cnf(c_326,negated_conjecture,
int_leq(int_one,sK2),
inference(demodulation,[status(thm)],[c_70]) ).
cnf(c_327,negated_conjecture,
int_less(sK2,sK1),
inference(demodulation,[status(thm)],[c_69]) ).
cnf(c_328,negated_conjecture,
int_leq(sK1,n),
inference(demodulation,[status(thm)],[c_68]) ).
cnf(c_329,negated_conjecture,
sP0_iProver_def != real_zero,
inference(demodulation,[status(thm)],[c_67,c_325]) ).
cnf(c_330,plain,
X0 = X0,
theory(equality) ).
cnf(c_332,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_796,plain,
int_leq(sK2,sK1),
inference(superposition,[status(thm)],[c_327,c_50]) ).
cnf(c_804,plain,
int_less(int_zero,sK2),
inference(superposition,[status(thm)],[c_326,c_62]) ).
cnf(c_833,plain,
( int_leq(X0,int_zero)
| int_leq(int_one,X0) ),
inference(superposition,[status(thm)],[c_54,c_63]) ).
cnf(c_894,plain,
( n = sK1
| int_less(sK1,n) ),
inference(superposition,[status(thm)],[c_328,c_51]) ).
cnf(c_929,plain,
( ~ int_less(X0,sK2)
| int_less(X0,sK1) ),
inference(superposition,[status(thm)],[c_327,c_52]) ).
cnf(c_956,plain,
( ~ int_less(X0,sK1)
| n = sK1
| int_less(X0,n) ),
inference(superposition,[status(thm)],[c_894,c_52]) ).
cnf(c_998,plain,
int_less(int_zero,sK1),
inference(superposition,[status(thm)],[c_804,c_929]) ).
cnf(c_1009,plain,
( ~ int_less(sK2,sK1)
| int_less(int_zero,sK0(sK2,sK1)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_1012,plain,
int_leq(int_one,sK1),
inference(superposition,[status(thm)],[c_998,c_63]) ).
cnf(c_1060,plain,
( n = sK1
| int_less(sK2,n) ),
inference(superposition,[status(thm)],[c_327,c_956]) ).
cnf(c_1087,plain,
( n = sK1
| int_leq(sK2,n) ),
inference(superposition,[status(thm)],[c_1060,c_50]) ).
cnf(c_1159,plain,
( real_zero != X0
| sP0_iProver_def != X0
| sP0_iProver_def = real_zero ),
inference(instantiation,[status(thm)],[c_332]) ).
cnf(c_1170,plain,
plus(sK2,sK0(sK2,sK1)) = sK1,
inference(superposition,[status(thm)],[c_327,c_61]) ).
cnf(c_1360,plain,
( ~ int_leq(sK0(sK2,sK1),X0)
| ~ int_less(sK2,X1)
| int_leq(sK1,plus(X1,X0)) ),
inference(superposition,[status(thm)],[c_1170,c_58]) ).
cnf(c_1859,plain,
( ~ int_less(sK2,X0)
| int_leq(sK1,plus(X0,int_zero))
| int_leq(int_one,sK0(sK2,sK1)) ),
inference(superposition,[status(thm)],[c_833,c_1360]) ).
cnf(c_1878,plain,
( ~ int_less(sK2,X0)
| int_leq(int_one,sK0(sK2,sK1))
| int_leq(sK1,X0) ),
inference(light_normalisation,[status(thm)],[c_1859,c_57]) ).
cnf(c_4855,plain,
sP0_iProver_def = sP0_iProver_def,
inference(instantiation,[status(thm)],[c_330]) ).
cnf(c_13659,plain,
( real_zero != sP0_iProver_def
| sP0_iProver_def != sP0_iProver_def
| sP0_iProver_def = real_zero ),
inference(instantiation,[status(thm)],[c_1159]) ).
cnf(c_20544,plain,
( int_leq(int_one,sK0(sK2,sK1))
| int_leq(X0,sK2)
| int_leq(sK1,X0) ),
inference(superposition,[status(thm)],[c_54,c_1878]) ).
cnf(c_20907,plain,
( int_less(int_zero,sK0(sK2,sK1))
| int_leq(X0,sK2)
| int_leq(sK1,X0) ),
inference(superposition,[status(thm)],[c_20544,c_62]) ).
cnf(c_21999,plain,
int_less(int_zero,sK0(sK2,sK1)),
inference(global_subsumption_just,[status(thm)],[c_20907,c_69,c_1009]) ).
cnf(c_32264,plain,
( ~ int_leq(int_one,plus(sK2,sK0(sK2,sK1)))
| ~ int_less(int_zero,sK0(sK2,sK1))
| ~ int_leq(X0,sK2)
| ~ int_leq(int_one,X0)
| ~ int_leq(sK1,n)
| ~ int_leq(sK2,n)
| ~ int_less(int_zero,sK2)
| a(plus(X0,sK0(sK2,sK1)),X0) = real_zero ),
inference(superposition,[status(thm)],[c_1170,c_142]) ).
cnf(c_32500,plain,
( ~ int_less(int_zero,sK0(sK2,sK1))
| ~ int_leq(X0,sK2)
| ~ int_leq(int_one,X0)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(sK2,n)
| ~ int_less(int_zero,sK2)
| a(plus(X0,sK0(sK2,sK1)),X0) = real_zero ),
inference(light_normalisation,[status(thm)],[c_32264,c_1170]) ).
cnf(c_32501,plain,
( ~ int_leq(X0,sK2)
| ~ int_leq(int_one,X0)
| ~ int_leq(sK2,n)
| a(plus(X0,sK0(sK2,sK1)),X0) = real_zero ),
inference(forward_subsumption_resolution,[status(thm)],[c_32500,c_804,c_328,c_1012,c_21999]) ).
cnf(c_34453,plain,
( ~ int_leq(int_one,sK2)
| ~ int_leq(sK2,n)
| a(plus(int_one,sK0(sK2,sK1)),int_one) = real_zero ),
inference(superposition,[status(thm)],[c_49,c_32501]) ).
cnf(c_34518,plain,
( ~ int_leq(sK2,n)
| ~ int_leq(sK2,sK2)
| a(plus(sK2,sK0(sK2,sK1)),sK2) = real_zero ),
inference(superposition,[status(thm)],[c_326,c_32501]) ).
cnf(c_34573,plain,
( ~ int_leq(sK2,n)
| ~ int_leq(sK2,sK2)
| real_zero = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_34518,c_325,c_1170]) ).
cnf(c_34574,plain,
( ~ int_leq(sK2,n)
| real_zero = sP0_iProver_def ),
inference(forward_subsumption_resolution,[status(thm)],[c_34573,c_49]) ).
cnf(c_34577,plain,
( ~ int_leq(sK2,n)
| a(plus(int_one,sK0(sK2,sK1)),int_one) = real_zero ),
inference(forward_subsumption_resolution,[status(thm)],[c_34453,c_326]) ).
cnf(c_34914,plain,
~ int_leq(sK2,n),
inference(global_subsumption_just,[status(thm)],[c_34577,c_329,c_4855,c_13659,c_34574]) ).
cnf(c_34916,plain,
n = sK1,
inference(backward_subsumption_resolution,[status(thm)],[c_1087,c_34914]) ).
cnf(c_35059,plain,
int_leq(sK2,n),
inference(demodulation,[status(thm)],[c_796,c_34916]) ).
cnf(c_35063,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_35059,c_34914]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SWV487+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 00:11:19 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.29/2.12 % SZS status Started for theBenchmark.p
% 10.29/2.12 % SZS status Theorem for theBenchmark.p
% 10.29/2.12
% 10.29/2.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.29/2.12
% 10.29/2.12 ------ iProver source info
% 10.29/2.12
% 10.29/2.12 git: date: 2024-05-02 19:28:25 +0000
% 10.29/2.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.29/2.12 git: non_committed_changes: false
% 10.29/2.12
% 10.29/2.12 ------ Parsing...
% 10.29/2.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.29/2.12
% 10.29/2.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 10.29/2.12
% 10.29/2.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.29/2.12
% 10.29/2.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.29/2.12 ------ Proving...
% 10.29/2.12 ------ Problem Properties
% 10.29/2.12
% 10.29/2.12
% 10.29/2.12 clauses 23
% 10.29/2.12 conjectures 4
% 10.29/2.12 EPR 14
% 10.29/2.12 Horn 21
% 10.29/2.12 unary 11
% 10.29/2.12 binary 7
% 10.29/2.12 lits 50
% 10.29/2.12 lits eq 9
% 10.29/2.12 fd_pure 0
% 10.29/2.12 fd_pseudo 0
% 10.29/2.12 fd_cond 0
% 10.29/2.12 fd_pseudo_cond 1
% 10.29/2.12 AC symbols 0
% 10.29/2.12
% 10.29/2.12 ------ Schedule dynamic 5 is on
% 10.29/2.12
% 10.29/2.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.29/2.12
% 10.29/2.12
% 10.29/2.12 ------
% 10.29/2.12 Current options:
% 10.29/2.12 ------
% 10.29/2.12
% 10.29/2.12
% 10.29/2.12
% 10.29/2.12
% 10.29/2.12 ------ Proving...
% 10.29/2.12
% 10.29/2.12
% 10.29/2.12 % SZS status Theorem for theBenchmark.p
% 10.29/2.12
% 10.29/2.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.29/2.12
% 10.29/2.12
%------------------------------------------------------------------------------