TSTP Solution File: ROB016-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ROB016-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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 : Unsatisfiable 2.79s 1.17s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 11 unt; 0 nHn; 9 RR)
% Number of literals : 16 ( 12 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
negate(add(d,e)) = negate(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).
cnf(c_50,plain,
positive_integer(k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_positive) ).
cnf(c_51,plain,
( negate(add(negate(X0),negate(add(X1,negate(X0))))) != X1
| ~ positive_integer(X2)
| negate(add(X0,multiply(X2,add(X1,negate(add(X1,negate(X0))))))) = negate(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_6) ).
cnf(c_52,negated_conjecture,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_result) ).
cnf(c_57,plain,
add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(c_58,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).
cnf(c_59,plain,
negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(c_67,plain,
negate(add(e,d)) = negate(e),
inference(theory_normalisation,[status(thm)],[c_49,c_58,c_57]) ).
cnf(c_269,plain,
negate(add(negate(add(X0,X1)),negate(add(X1,negate(X0))))) = X1,
inference(superposition,[status(thm)],[c_57,c_59]) ).
cnf(c_403,plain,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
inference(superposition,[status(thm)],[c_67,c_269]) ).
cnf(c_514,plain,
( ~ positive_integer(X0)
| negate(add(e,multiply(X0,add(d,negate(add(d,negate(e))))))) = negate(e) ),
inference(superposition,[status(thm)],[c_403,c_51]) ).
cnf(c_8130,plain,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) = negate(e),
inference(superposition,[status(thm)],[c_50,c_514]) ).
cnf(c_8133,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8130,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ROB016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n008.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 : Mon Aug 28 06:55:32 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.79/1.17 % SZS status Started for theBenchmark.p
% 2.79/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.79/1.17
% 2.79/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.79/1.17
% 2.79/1.17 ------ iProver source info
% 2.79/1.17
% 2.79/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.79/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.79/1.17 git: non_committed_changes: false
% 2.79/1.17 git: last_make_outside_of_git: false
% 2.79/1.17
% 2.79/1.17 ------ Parsing...successful
% 2.79/1.17
% 2.79/1.17
% 2.79/1.17
% 2.79/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.79/1.17
% 2.79/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.79/1.17
% 2.79/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.79/1.17 ------ Proving...
% 2.79/1.17 ------ Problem Properties
% 2.79/1.17
% 2.79/1.17
% 2.79/1.17 clauses 11
% 2.79/1.17 conjectures 1
% 2.79/1.17 EPR 2
% 2.79/1.17 Horn 11
% 2.79/1.17 unary 8
% 2.79/1.17 binary 2
% 2.79/1.17 lits 15
% 2.79/1.17 lits eq 9
% 2.79/1.17 fd_pure 0
% 2.79/1.17 fd_pseudo 0
% 2.79/1.17 fd_cond 0
% 2.79/1.17 fd_pseudo_cond 0
% 2.79/1.17 AC symbols 1
% 2.79/1.17
% 2.79/1.17 ------ Schedule dynamic 5 is on
% 2.79/1.17
% 2.79/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.79/1.17
% 2.79/1.17
% 2.79/1.17 ------
% 2.79/1.17 Current options:
% 2.79/1.17 ------
% 2.79/1.17
% 2.79/1.17
% 2.79/1.17
% 2.79/1.17
% 2.79/1.17 ------ Proving...
% 2.79/1.17
% 2.79/1.17
% 2.79/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.79/1.17
% 2.79/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.79/1.17
% 2.79/1.17
%------------------------------------------------------------------------------