TSTP Solution File: NUM835+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM835+1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 : Mon Jun 24 12:55:45 EDT 2024
% Result : Theorem 0.43s 1.13s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f147)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( vd165 = vd151
| ? [X1] : vd151 = vplus(vd165,X1)
| ? [X0] : vd165 = vplus(vd151,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dis(case_distinction(conseq(110)))') ).
fof(f2,negated_conjecture,
~ ( vd165 = vd151
| ? [X1] : vd151 = vplus(vd165,X1)
| ? [X0] : vd165 = vplus(vd151,X0) ),
inference(negated_conjecture,[],[f1]) ).
fof(f41,plain,
~ ( vd165 = vd151
| ? [X0] : vd151 = vplus(vd165,X0)
| ? [X1] : vd165 = vplus(vd151,X1) ),
inference(rectify,[],[f2]) ).
fof(f72,plain,
( vd165 != vd151
& ! [X0] : vd151 != vplus(vd165,X0)
& ! [X1] : vd165 != vplus(vd151,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f122,plain,
! [X0] : vd151 != vplus(vd165,X0),
inference(cnf_transformation,[],[f72]) ).
fof(f123,plain,
vd165 != vd151,
inference(cnf_transformation,[],[f72]) ).
cnf(c_49,negated_conjecture,
vd165 != vd151,
inference(cnf_transformation,[],[f123]) ).
cnf(c_50,negated_conjecture,
vplus(vd165,X0) != vd151,
inference(cnf_transformation,[],[f122]) ).
cnf(c_51,negated_conjecture,
vplus(vd151,X0) != vd165,
inference(cnf_transformation,[],[f121]) ).
cnf(c_70,plain,
m(X0),
inference(cnf_transformation,[],[f205]) ).
cnf(c_71,plain,
( ~ m(X0)
| vplus(X0,sK2(X1,X0)) = X1
| vplus(X1,sK1(X1,X0)) = X0
| X0 = X1 ),
inference(cnf_transformation,[],[f147]) ).
cnf(c_125,plain,
( vplus(X0,sK2(X1,X0)) = X1
| vplus(X1,sK1(X1,X0)) = X0
| X0 = X1 ),
inference(global_subsumption_just,[status(thm)],[c_71,c_70,c_71]) ).
cnf(c_246,negated_conjecture,
vplus(vd151,X0) != vd165,
inference(demodulation,[status(thm)],[c_51]) ).
cnf(c_247,negated_conjecture,
vplus(vd165,X0) != vd151,
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_248,negated_conjecture,
vd165 != vd151,
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_323,plain,
( X0 != vd151
| vplus(X0,sK2(vd165,X0)) = vd165
| X0 = vd165 ),
inference(superposition,[status(thm)],[c_125,c_247]) ).
cnf(c_526,plain,
( vplus(vd151,sK2(vd165,vd151)) = vd165
| vd165 = vd151 ),
inference(equality_resolution,[status(thm)],[c_323]) ).
cnf(c_527,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_526,c_248,c_246]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM835+1 : TPTP v8.2.0. Released v4.1.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.09/0.31 % Computer : n028.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Sat Jun 22 22:59:39 EDT 2024
% 0.09/0.31 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.43/1.13 % SZS status Started for theBenchmark.p
% 0.43/1.13 % SZS status Theorem for theBenchmark.p
% 0.43/1.13
% 0.43/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.13
% 0.43/1.13 ------ iProver source info
% 0.43/1.13
% 0.43/1.13 git: date: 2024-06-12 09:56:46 +0000
% 0.43/1.13 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.43/1.13 git: non_committed_changes: false
% 0.43/1.13
% 0.43/1.13 ------ Parsing...
% 0.43/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.13
% 0.43/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.43/1.13
% 0.43/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.13
% 0.43/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.43/1.13 ------ Proving...
% 0.43/1.13 ------ Problem Properties
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 clauses 12
% 0.43/1.13 conjectures 3
% 0.43/1.13 EPR 1
% 0.43/1.13 Horn 9
% 0.43/1.13 unary 8
% 0.43/1.13 binary 3
% 0.43/1.13 lits 17
% 0.43/1.13 lits eq 17
% 0.43/1.13 fd_pure 0
% 0.43/1.13 fd_pseudo 0
% 0.43/1.13 fd_cond 0
% 0.43/1.13 fd_pseudo_cond 1
% 0.43/1.13 AC symbols 1
% 0.43/1.13
% 0.43/1.13 ------ Schedule dynamic 5 is on
% 0.43/1.13
% 0.43/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 ------
% 0.43/1.13 Current options:
% 0.43/1.13 ------
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 ------ Proving...
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 % SZS status Theorem for theBenchmark.p
% 0.43/1.13
% 0.43/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.13
% 0.43/1.13
%------------------------------------------------------------------------------