TSTP Solution File: NUM839+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:09 EDT 2023
% Result : Theorem 2.61s 1.20s
% Output : CNFRefutation 2.61s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f107)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ greater(vd328,vd329),
inference(cnf_transformation,[],[f106]) ).
cnf(c_50,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnf_transformation,[],[f107]) ).
cnf(c_52,plain,
( ~ greater(X0,X1)
| greater(vplus(X0,X2),vplus(X1,X2)) ),
inference(cnf_transformation,[],[f110]) ).
cnf(c_66,plain,
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_67,plain,
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_68,plain,
( X0 = X1
| greater(X0,X1)
| less(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_70,plain,
( ~ greater(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_917,plain,
less(vplus(vd329,vd330),vplus(vd328,vd330)),
inference(superposition,[status(thm)],[c_50,c_67]) ).
cnf(c_950,plain,
~ greater(vplus(vd329,vd330),vplus(vd328,vd330)),
inference(superposition,[status(thm)],[c_917,c_70]) ).
cnf(c_1048,plain,
( vd328 = vd329
| less(vd328,vd329) ),
inference(superposition,[status(thm)],[c_68,c_49]) ).
cnf(c_1135,plain,
~ greater(vd329,vd328),
inference(superposition,[status(thm)],[c_52,c_950]) ).
cnf(c_1198,plain,
( vd328 = vd329
| greater(vd329,vd328) ),
inference(superposition,[status(thm)],[c_1048,c_66]) ).
cnf(c_1202,plain,
vd328 = vd329,
inference(forward_subsumption_resolution,[status(thm)],[c_1198,c_1135]) ).
cnf(c_1207,plain,
greater(vplus(vd328,vd330),vplus(vd328,vd330)),
inference(demodulation,[status(thm)],[c_50,c_1202]) ).
fof(f14,axiom,
! [X20,X21] :
( geq(X21,X20)
<=> ( X20 = X21
| greater(X21,X20) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof(f122,plain,
! [X0,X1] :
( geq(X1,X0)
| ~ greater(X1,X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f47,plain,
! [X0,X1] :
( geq(X1,X0)
<=> ( X0 = X1
| greater(X1,X0) ) ),
inference(rectify,[],[f14]) ).
fof(f93,plain,
! [X0,X1] :
( ( geq(X1,X0)
| ( X0 != X1
& ~ greater(X1,X0) ) )
& ( X0 = X1
| greater(X1,X0)
| ~ geq(X1,X0) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f94,plain,
! [X0,X1] :
( ( geq(X1,X0)
| ( X0 != X1
& ~ greater(X1,X0) ) )
& ( X0 = X1
| greater(X1,X0)
| ~ geq(X1,X0) ) ),
inference(flattening,[],[f93]) ).
fof(f15,axiom,
! [X22,X23] :
( less(X22,X23)
=> greater(X23,X22) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof(f121,plain,
! [X0,X1] :
( X0 = X1
| greater(X1,X0)
| ~ geq(X1,X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f48,plain,
! [X0,X1] :
( less(X0,X1)
=> greater(X1,X0) ),
inference(rectify,[],[f15]) ).
fof(f82,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f48]) ).
fof(f16,axiom,
! [X24,X25] :
( greater(X24,X25)
=> less(X25,X24) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof(f124,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f49,plain,
! [X0,X1] :
( greater(X0,X1)
=> less(X1,X0) ),
inference(rectify,[],[f16]) ).
fof(f83,plain,
! [X0,X1] :
( less(X1,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f17,axiom,
! [X26,X27] :
( less(X26,X27)
| greater(X26,X27)
| X26 = X27 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof(f125,plain,
! [X0,X1] :
( less(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f50,plain,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(rectify,[],[f17]) ).
fof(f18,axiom,
! [X26,X27] :
( ~ less(X26,X27)
| X26 != X27 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).
fof(f126,plain,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f50]) ).
fof(f51,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 != X1 ),
inference(rectify,[],[f18]) ).
fof(f127,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f51]) ).
fof(f19,axiom,
! [X26,X27] :
( ~ less(X26,X27)
| ~ greater(X26,X27) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).
fof(f162,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f127]) ).
fof(f52,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
inference(rectify,[],[f19]) ).
fof(f20,axiom,
! [X26,X27] :
( ~ greater(X26,X27)
| X26 != X27 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 3)') ).
fof(f128,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f53,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
inference(rectify,[],[f20]) ).
fof(f129,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f53]) ).
fof(f163,plain,
! [X1] : ~ greater(X1,X1),
inference(equality_resolution,[],[f129]) ).
cnf(c_71,plain,
~ greater(X0,X0),
inference(cnf_transformation,[],[f163]) ).
cnf(c_1209,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1207,c_71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.15 % Command : run_iprover %s %d THM
% 0.14/0.37 % Computer : n010.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Fri Aug 25 11:52:20 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.61/1.20 % SZS status Started for theBenchmark.p
% 2.61/1.20 % SZS status Theorem for theBenchmark.p
% 2.61/1.20
% 2.61/1.20 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.61/1.20
% 2.61/1.20 ------ iProver source info
% 2.61/1.20
% 2.61/1.20 git: date: 2023-05-31 18:12:56 +0000
% 2.61/1.20 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.61/1.20 git: non_committed_changes: false
% 2.61/1.20 git: last_make_outside_of_git: false
% 2.61/1.20
% 2.61/1.20 ------ Parsing...
% 2.61/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.61/1.20
% 2.61/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.61/1.20
% 2.61/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.61/1.20
% 2.61/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.61/1.20 ------ Proving...
% 2.61/1.20 ------ Problem Properties
% 2.61/1.20
% 2.61/1.20
% 2.61/1.20 clauses 30
% 2.61/1.20 conjectures 1
% 2.61/1.20 EPR 16
% 2.61/1.20 Horn 25
% 2.61/1.20 unary 11
% 2.61/1.20 binary 11
% 2.61/1.20 lits 57
% 2.61/1.20 lits eq 16
% 2.61/1.20 fd_pure 0
% 2.61/1.20 fd_pseudo 0
% 2.61/1.20 fd_cond 0
% 2.61/1.20 fd_pseudo_cond 4
% 2.61/1.20 AC symbols 1
% 2.61/1.20
% 2.61/1.20 ------ Schedule dynamic 5 is on
% 2.61/1.20
% 2.61/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.61/1.20
% 2.61/1.20
% 2.61/1.20 ------
% 2.61/1.20 Current options:
% 2.61/1.20 ------
% 2.61/1.20
% 2.61/1.20
% 2.61/1.20
% 2.61/1.20
% 2.61/1.20 ------ Proving...
% 2.61/1.20
% 2.61/1.20
% 2.61/1.20 % SZS status Theorem for theBenchmark.p
% 2.61/1.20
% 2.61/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.61/1.20
% 2.61/1.20
%------------------------------------------------------------------------------