TSTP Solution File: ROB021-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ROB021-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:28 EDT 2023
% Result : Unsatisfiable 3.88s 1.19s
% Output : CNFRefutation 3.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 4 RR)
% Number of literals : 12 ( 11 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( negate(X0) != negate(X1)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',negative_equality_implies_positive_equality) ).
cnf(c_50,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).
cnf(c_51,plain,
add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(c_52,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_53,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_58,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(theory_normalisation,[status(thm)],[c_50,c_52,c_51]) ).
cnf(c_151,plain,
( negate(X0) != X1
| add(negate(add(X1,X2)),negate(add(X1,negate(X2)))) = X0 ),
inference(superposition,[status(thm)],[c_53,c_49]) ).
cnf(c_648,plain,
add(negate(add(negate(X0),X1)),negate(add(negate(X0),negate(X1)))) = X0,
inference(equality_resolution,[status(thm)],[c_151]) ).
cnf(c_678,plain,
add(negate(add(X0,negate(X1))),negate(add(negate(X1),negate(X0)))) = X1,
inference(superposition,[status(thm)],[c_51,c_648]) ).
cnf(c_755,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_58,c_678]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : ROB021-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Aug 28 07:10:26 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.88/1.19 % SZS status Started for theBenchmark.p
% 3.88/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.88/1.19
% 3.88/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.88/1.19
% 3.88/1.19 ------ iProver source info
% 3.88/1.19
% 3.88/1.19 git: date: 2023-05-31 18:12:56 +0000
% 3.88/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.88/1.19 git: non_committed_changes: false
% 3.88/1.19 git: last_make_outside_of_git: false
% 3.88/1.19
% 3.88/1.19 ------ Parsing...successful
% 3.88/1.19
% 3.88/1.19
% 3.88/1.19
% 3.88/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.88/1.19
% 3.88/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.88/1.19
% 3.88/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.88/1.19 ------ Proving...
% 3.88/1.19 ------ Problem Properties
% 3.88/1.19
% 3.88/1.19
% 3.88/1.19 clauses 5
% 3.88/1.19 conjectures 1
% 3.88/1.19 EPR 0
% 3.88/1.19 Horn 5
% 3.88/1.19 unary 4
% 3.88/1.19 binary 1
% 3.88/1.19 lits 6
% 3.88/1.19 lits eq 6
% 3.88/1.19 fd_pure 0
% 3.88/1.19 fd_pseudo 0
% 3.88/1.19 fd_cond 0
% 3.88/1.19 fd_pseudo_cond 1
% 3.88/1.19 AC symbols 1
% 3.88/1.19
% 3.88/1.19 ------ Schedule dynamic 5 is on
% 3.88/1.19
% 3.88/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.88/1.19
% 3.88/1.19
% 3.88/1.19 ------
% 3.88/1.19 Current options:
% 3.88/1.19 ------
% 3.88/1.19
% 3.88/1.19
% 3.88/1.19
% 3.88/1.19
% 3.88/1.19 ------ Proving...
% 3.88/1.19
% 3.88/1.19
% 3.88/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.88/1.19
% 3.88/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.88/1.19
% 3.88/1.19
%------------------------------------------------------------------------------