TSTP Solution File: NUM840+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM840+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:10 EDT 2023
% Result : Theorem 1.37s 1.19s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f71)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ less(vd328,vd329),
inference(cnf_transformation,[],[f70]) ).
cnf(c_50,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnf_transformation,[],[f71]) ).
cnf(c_54,plain,
( ~ greater(X0,X1)
| greater(vplus(X0,X2),vplus(X1,X2)) ),
inference(cnf_transformation,[],[f76]) ).
cnf(c_55,plain,
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f77]) ).
cnf(c_56,plain,
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[],[f78]) ).
cnf(c_57,plain,
( X0 = X1
| less(X0,X1)
| greater(X0,X1) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_58,plain,
~ less(X0,X0),
inference(cnf_transformation,[],[f103]) ).
cnf(c_59,plain,
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_579,plain,
~ greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(superposition,[status(thm)],[c_50,c_59]) ).
cnf(c_609,plain,
( X0 = X1
| less(X0,X1)
| less(X1,X0) ),
inference(superposition,[status(thm)],[c_57,c_56]) ).
cnf(c_626,plain,
( vd328 = vd329
| less(vd329,vd328) ),
inference(superposition,[status(thm)],[c_609,c_49]) ).
cnf(c_645,plain,
( vd328 = vd329
| greater(vd328,vd329) ),
inference(superposition,[status(thm)],[c_626,c_55]) ).
cnf(c_798,plain,
~ greater(vd328,vd329),
inference(superposition,[status(thm)],[c_54,c_579]) ).
cnf(c_824,plain,
vd328 = vd329,
inference(backward_subsumption_resolution,[status(thm)],[c_645,c_798]) ).
cnf(c_827,plain,
less(vplus(vd328,vd330),vplus(vd328,vd330)),
inference(demodulation,[status(thm)],[c_50,c_824]) ).
cnf(c_829,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_827,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM840+2 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n017.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 07:40:40 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.37/1.19 % SZS status Started for theBenchmark.p
% 1.37/1.19 % SZS status Theorem for theBenchmark.p
% 1.37/1.19
% 1.37/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.37/1.19
% 1.37/1.19 ------ iProver source info
% 1.37/1.19
% 1.37/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.37/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.37/1.19 git: non_committed_changes: false
% 1.37/1.19 git: last_make_outside_of_git: false
% 1.37/1.19
% 1.37/1.19 ------ Parsing...
% 1.37/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.37/1.19
% 1.37/1.19 ------ 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
% 1.37/1.19
% 1.37/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.37/1.19
% 1.37/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.37/1.19 ------ Proving...
% 1.37/1.19 ------ Problem Properties
% 1.37/1.19
% 1.37/1.19
% 1.37/1.19 clauses 22
% 1.37/1.19 conjectures 1
% 1.37/1.19 EPR 7
% 1.37/1.19 Horn 20
% 1.37/1.19 unary 10
% 1.37/1.19 binary 10
% 1.37/1.19 lits 36
% 1.37/1.19 lits eq 14
% 1.37/1.19 fd_pure 0
% 1.37/1.19 fd_pseudo 0
% 1.37/1.19 fd_cond 0
% 1.37/1.19 fd_pseudo_cond 2
% 1.37/1.19 AC symbols 1
% 1.37/1.19
% 1.37/1.19 ------ Schedule dynamic 5 is on
% 1.37/1.19
% 1.37/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.37/1.19
% 1.37/1.19
% 1.37/1.19 ------
% 1.37/1.19 Current options:
% 1.37/1.19 ------
% 1.37/1.19
% 1.37/1.19
% 1.37/1.19
% 1.37/1.19
% 1.37/1.19 ------ Proving...
% 1.37/1.19
% 1.37/1.19
% 1.37/1.19 % SZS status Theorem for theBenchmark.p
% 1.37/1.19
% 1.37/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.37/1.19
% 1.37/1.19
%------------------------------------------------------------------------------