TSTP Solution File: NUM857+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM857+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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 : Thu Aug 31 11:33:19 EDT 2023
% Result : Theorem 3.75s 1.09s
% Output : CNFRefutation 3.75s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f216)
% Comments :
%------------------------------------------------------------------------------
fof(f2,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(negated_conjecture,[],[f1]) ).
fof(f63,plain,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(flattening,[],[f2]) ).
fof(f3,axiom,
geq(vd529,vd530),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct2(antec(323)), 531, 0)') ).
fof(f174,plain,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(cnf_transformation,[],[f63]) ).
fof(f4,axiom,
geq(vd526,vd527),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct1(antec(323)), 528, 0)') ).
fof(f175,plain,
geq(vd529,vd530),
inference(cnf_transformation,[],[f3]) ).
fof(f176,plain,
geq(vd526,vd527),
inference(cnf_transformation,[],[f4]) ).
cnf(c_49,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(cnf_transformation,[],[f174]) ).
cnf(c_50,plain,
geq(vd529,vd530),
inference(cnf_transformation,[],[f175]) ).
cnf(c_51,plain,
geq(vd526,vd527),
inference(cnf_transformation,[],[f176]) ).
cnf(c_52,plain,
( ~ geq(X0,X1)
| ~ greater(X2,X3)
| greater(vmul(X2,X0),vmul(X3,X1)) ),
inference(cnf_transformation,[],[f178]) ).
cnf(c_53,plain,
( ~ geq(X0,X1)
| ~ greater(X2,X3)
| greater(vmul(X0,X2),vmul(X1,X3)) ),
inference(cnf_transformation,[],[f177]) ).
cnf(c_90,plain,
( ~ greater(X0,X1)
| geq(X0,X1) ),
inference(cnf_transformation,[],[f217]) ).
cnf(c_91,plain,
( ~ geq(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(cnf_transformation,[],[f216]) ).
cnf(c_92,plain,
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_106,plain,
( vplus(X0,X1) != vplus(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f233]) ).
cnf(c_617,plain,
X0 = X0,
theory(equality) ).
cnf(c_620,plain,
( X0 != X1
| X2 != X3
| vmul(X0,X2) = vmul(X1,X3) ),
theory(equality) ).
cnf(c_621,plain,
( X0 != X1
| X2 != X3
| ~ geq(X1,X3)
| geq(X0,X2) ),
theory(equality) ).
cnf(c_1168,plain,
( ~ greater(vmul(vd526,vd529),vmul(vd527,vd530))
| geq(vmul(vd526,vd529),vmul(vd527,vd530)) ),
inference(instantiation,[status(thm)],[c_90]) ).
cnf(c_1169,plain,
( vmul(vd526,vd529) != X0
| vmul(vd527,vd530) != X1
| ~ geq(X0,X1)
| geq(vmul(vd526,vd529),vmul(vd527,vd530)) ),
inference(instantiation,[status(thm)],[c_621]) ).
cnf(c_1172,plain,
( vplus(X0,vmul(vd527,vd530)) != vplus(X0,X1)
| vmul(vd527,vd530) = X1 ),
inference(instantiation,[status(thm)],[c_106]) ).
cnf(c_1189,plain,
( vmul(vd526,vd529) != X0
| vmul(vd527,vd530) != vmul(vd527,vd530)
| ~ geq(X0,vmul(vd527,vd530))
| geq(vmul(vd526,vd529),vmul(vd527,vd530)) ),
inference(instantiation,[status(thm)],[c_1169]) ).
cnf(c_1204,plain,
( ~ geq(vd529,vd530)
| ~ greater(vd526,vd527)
| greater(vmul(vd526,vd529),vmul(vd527,vd530)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_1205,plain,
( ~ geq(vd526,vd527)
| ~ greater(vd529,vd530)
| greater(vmul(vd526,vd529),vmul(vd527,vd530)) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_1237,plain,
( ~ less(vd527,vd526)
| greater(vd526,vd527) ),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_1297,plain,
( vplus(X0,vmul(vd527,vd530)) != vplus(X0,vmul(vd527,vd530))
| vmul(vd527,vd530) = vmul(vd527,vd530) ),
inference(instantiation,[status(thm)],[c_1172]) ).
cnf(c_1350,plain,
( vmul(vd526,vd529) != vmul(vd527,vd530)
| vmul(vd527,vd530) != vmul(vd527,vd530)
| ~ geq(vmul(vd527,vd530),vmul(vd527,vd530))
| geq(vmul(vd526,vd529),vmul(vd527,vd530)) ),
inference(instantiation,[status(thm)],[c_1189]) ).
cnf(c_1727,plain,
vplus(X0,vmul(vd527,vd530)) = vplus(X0,vmul(vd527,vd530)),
inference(instantiation,[status(thm)],[c_617]) ).
cnf(c_2392,plain,
( vd526 != vd527
| vd529 != vd530
| vmul(vd526,vd529) = vmul(vd527,vd530) ),
inference(instantiation,[status(thm)],[c_620]) ).
cnf(c_3241,plain,
( ~ geq(vd529,vd530)
| vd529 = vd530
| greater(vd529,vd530) ),
inference(instantiation,[status(thm)],[c_91]) ).
fof(f33,axiom,
! [X65,X66,X67] :
( ( ( less(X65,X66)
& leq(X66,X67) )
| ( leq(X65,X66)
& less(X66,X67) ) )
=> less(X65,X67) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(177), 0), 0)') ).
fof(f209,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f145]) ).
fof(f37,axiom,
! [X75,X76] :
( leq(X76,X75)
<=> ( X75 = X76
| less(X76,X75) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 17), 1)') ).
fof(f214,plain,
! [X0,X1] :
( leq(X1,X0)
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f38,axiom,
! [X77,X78] :
( geq(X78,X77)
<=> ( X77 = X78
| greater(X78,X77) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof(f217,plain,
! [X0,X1] :
( geq(X1,X0)
| ~ greater(X1,X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( ( less(X0,X1)
& leq(X1,X2) )
| ( leq(X0,X1)
& less(X1,X2) ) )
=> less(X0,X2) ),
inference(rectify,[],[f33]) ).
fof(f95,plain,
! [X0,X1] :
( leq(X1,X0)
<=> ( X0 = X1
| less(X1,X0) ) ),
inference(rectify,[],[f37]) ).
fof(f96,plain,
! [X0,X1] :
( geq(X1,X0)
<=> ( X0 = X1
| greater(X1,X0) ) ),
inference(rectify,[],[f38]) ).
fof(f145,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ( ( ~ less(X0,X1)
| ~ leq(X1,X2) )
& ( ~ leq(X0,X1)
| ~ less(X1,X2) ) ) ),
inference(ennf_transformation,[],[f91]) ).
fof(f34,axiom,
! [X68,X69,X70] :
( ( less(X68,X69)
& less(X69,X70) )
=> less(X68,X70) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).
fof(f208,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f145]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( less(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
inference(rectify,[],[f34]) ).
fof(f146,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f92]) ).
fof(f147,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f146]) ).
fof(f35,axiom,
! [X71,X72] :
( leq(X71,X72)
=> geq(X72,X71) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(163, 0), 0)') ).
fof(f210,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f147]) ).
fof(f93,plain,
! [X0,X1] :
( leq(X0,X1)
=> geq(X1,X0) ),
inference(rectify,[],[f35]) ).
fof(f148,plain,
! [X0,X1] :
( geq(X1,X0)
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f93]) ).
fof(f36,axiom,
! [X73,X74] :
( geq(X73,X74)
=> leq(X74,X73) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(158, 0), 0)') ).
fof(f211,plain,
! [X0,X1] :
( geq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f148]) ).
fof(f94,plain,
! [X0,X1] :
( geq(X0,X1)
=> leq(X1,X0) ),
inference(rectify,[],[f36]) ).
fof(f149,plain,
! [X0,X1] :
( leq(X1,X0)
| ~ geq(X0,X1) ),
inference(ennf_transformation,[],[f94]) ).
fof(f159,plain,
! [X0,X1] :
( ( leq(X1,X0)
| ( X0 != X1
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| ~ leq(X1,X0) ) ),
inference(nnf_transformation,[],[f95]) ).
fof(f160,plain,
! [X0,X1] :
( ( leq(X1,X0)
| ( X0 != X1
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| ~ leq(X1,X0) ) ),
inference(flattening,[],[f159]) ).
fof(f161,plain,
! [X0,X1] :
( ( geq(X1,X0)
| ( X0 != X1
& ~ greater(X1,X0) ) )
& ( X0 = X1
| greater(X1,X0)
| ~ geq(X1,X0) ) ),
inference(nnf_transformation,[],[f96]) ).
fof(f162,plain,
! [X0,X1] :
( ( geq(X1,X0)
| ( X0 != X1
& ~ greater(X1,X0) ) )
& ( X0 = X1
| greater(X1,X0)
| ~ geq(X1,X0) ) ),
inference(flattening,[],[f161]) ).
fof(f212,plain,
! [X0,X1] :
( leq(X1,X0)
| ~ geq(X0,X1) ),
inference(cnf_transformation,[],[f149]) ).
fof(f213,plain,
! [X0,X1] :
( X0 = X1
| less(X1,X0)
| ~ leq(X1,X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f218,plain,
! [X0,X1] :
( geq(X1,X0)
| X0 != X1 ),
inference(cnf_transformation,[],[f162]) ).
fof(f259,plain,
! [X1] : geq(X1,X1),
inference(equality_resolution,[],[f218]) ).
cnf(c_85,plain,
( ~ geq(X0,X1)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f212]) ).
cnf(c_88,plain,
( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) ),
inference(cnf_transformation,[],[f213]) ).
cnf(c_89,plain,
geq(X0,X0),
inference(cnf_transformation,[],[f259]) ).
cnf(c_1465,plain,
geq(vmul(vd527,vd530),vmul(vd527,vd530)),
inference(instantiation,[status(thm)],[c_89]) ).
cnf(c_4712,plain,
leq(vd527,vd526),
inference(superposition,[status(thm)],[c_51,c_85]) ).
cnf(c_7412,plain,
( vd526 = vd527
| less(vd527,vd526) ),
inference(superposition,[status(thm)],[c_4712,c_88]) ).
cnf(c_7441,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7412,c_3241,c_2392,c_1727,c_1465,c_1350,c_1297,c_1237,c_1205,c_1204,c_1168,c_49,c_50,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM857+2 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 13:23:28 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.45 Running first-order theorem proving
% 0.20/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.75/1.09 % SZS status Started for theBenchmark.p
% 3.75/1.09 % SZS status Theorem for theBenchmark.p
% 3.75/1.09
% 3.75/1.09 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.75/1.09
% 3.75/1.09 ------ iProver source info
% 3.75/1.09
% 3.75/1.09 git: date: 2023-05-31 18:12:56 +0000
% 3.75/1.09 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.75/1.09 git: non_committed_changes: false
% 3.75/1.09 git: last_make_outside_of_git: false
% 3.75/1.09
% 3.75/1.09 ------ Parsing...
% 3.75/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.75/1.09
% 3.75/1.09 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.75/1.09
% 3.75/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.75/1.09
% 3.75/1.09 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.75/1.09 ------ Proving...
% 3.75/1.09 ------ Problem Properties
% 3.75/1.09
% 3.75/1.09
% 3.75/1.09 clauses 59
% 3.75/1.09 conjectures 1
% 3.75/1.09 EPR 21
% 3.75/1.09 Horn 54
% 3.75/1.09 unary 21
% 3.75/1.09 binary 23
% 3.75/1.09 lits 112
% 3.75/1.09 lits eq 27
% 3.75/1.09 fd_pure 0
% 3.75/1.09 fd_pseudo 0
% 3.75/1.09 fd_cond 0
% 3.75/1.09 fd_pseudo_cond 6
% 3.75/1.09 AC symbols 2
% 3.75/1.09
% 3.75/1.09 ------ Input Options Time Limit: Unbounded
% 3.75/1.09
% 3.75/1.09
% 3.75/1.09 ------
% 3.75/1.09 Current options:
% 3.75/1.09 ------
% 3.75/1.09
% 3.75/1.09
% 3.75/1.09
% 3.75/1.09
% 3.75/1.09 ------ Proving...
% 3.75/1.09
% 3.75/1.09
% 3.75/1.09 % SZS status Theorem for theBenchmark.p
% 3.75/1.09
% 3.75/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.75/1.09
% 3.75/1.09
%------------------------------------------------------------------------------