TSTP Solution File: ROB015-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ROB015-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 14:08:26 EDT 2023
% Result : Satisfiable 271.95s 36.46s
% Output : Saturation 271.95s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( negate(add(X0,negate(add(X1,X2)))) != negate(add(X1,negate(add(X0,X2))))
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_2) ).
cnf(c_50,plain,
( negate(add(X0,negate(X1))) != X2
| ~ positive_integer(X3)
| negate(add(X0,negate(add(X1,multiply(X3,add(X0,X2)))))) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_4) ).
cnf(c_51,plain,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).
cnf(c_52,plain,
positive_integer(k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_positive) ).
cnf(c_53,plain,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',base_step) ).
cnf(c_54,negated_conjecture,
negate(add(e,multiply(successor(k),add(d,negate(add(d,negate(e))))))) != negate(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_induction_step) ).
cnf(c_55,plain,
multiply(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',one_times_x) ).
cnf(c_56,plain,
( ~ positive_integer(X0)
| add(X0,multiply(X1,X0)) = multiply(successor(X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',times_by_adding) ).
cnf(c_57,plain,
positive_integer(one),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',one) ).
cnf(c_58,plain,
( ~ positive_integer(X0)
| positive_integer(successor(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',next_integer) ).
cnf(c_59,plain,
add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(c_60,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).
cnf(c_61,plain,
negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(c_62,plain,
( ~ positive_integer(X0)
| negate(add(X1,negate(add(X2,multiply(X0,add(X1,negate(add(X1,negate(X2))))))))) = negate(add(X1,negate(X2))) ),
inference(unflattening,[status(thm)],[c_50]) ).
cnf(c_106,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_264,plain,
add(X0,add(X1,X2)) = add(X1,add(X0,X2)),
inference(superposition,[status(thm)],[c_60,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ROB015-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 07:22:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 271.95/36.46 % SZS status Started for theBenchmark.p
% 271.95/36.46 % SZS status Satisfiable for theBenchmark.p
% 271.95/36.46
% 271.95/36.46 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 271.95/36.46
% 271.95/36.46 ------ iProver source info
% 271.95/36.46
% 271.95/36.46 git: date: 2023-05-31 18:12:56 +0000
% 271.95/36.46 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 271.95/36.46 git: non_committed_changes: false
% 271.95/36.46 git: last_make_outside_of_git: false
% 271.95/36.46
% 271.95/36.46 ------ Parsing...successful
% 271.95/36.46
% 271.95/36.46
% 271.95/36.46
% 271.95/36.46 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 271.95/36.46
% 271.95/36.46 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 271.95/36.46
% 271.95/36.46 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 271.95/36.46 ------ Proving...
% 271.95/36.46 ------ Problem Properties
% 271.95/36.46
% 271.95/36.46
% 271.95/36.46 clauses 13
% 271.95/36.46 conjectures 1
% 271.95/36.46 EPR 2
% 271.95/36.46 Horn 13
% 271.95/36.46 unary 9
% 271.95/36.46 binary 4
% 271.95/36.46 lits 17
% 271.95/36.46 lits eq 11
% 271.95/36.46 fd_pure 0
% 271.95/36.46 fd_pseudo 0
% 271.95/36.46 fd_cond 0
% 271.95/36.46 fd_pseudo_cond 1
% 271.95/36.46 AC symbols 1
% 271.95/36.46
% 271.95/36.46 ------ Input Options Time Limit: Unbounded
% 271.95/36.46
% 271.95/36.46
% 271.95/36.46 ------
% 271.95/36.46 Current options:
% 271.95/36.46 ------
% 271.95/36.46
% 271.95/36.46
% 271.95/36.46
% 271.95/36.46
% 271.95/36.46 ------ Proving...
% 271.95/36.46
% 271.95/36.46
% 271.95/36.46 % SZS status Satisfiable for theBenchmark.p
% 271.95/36.46
% 271.95/36.46 % SZS output start Saturation for theBenchmark.p
% See solution above
% 271.95/36.46
% 271.95/36.46
%------------------------------------------------------------------------------