↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : ROB002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:39:41 PM UTC 2026

% Result   : Unsatisfiable 2.05s 1.16s
% Output   : CNFRefutation 2.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   16 (  16 unt;   0 def)
%            Number of atoms       :   16 (  15 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            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   :   20 (   0 sgn  20   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).

fof(f2,axiom,
    ! [X2,X0,X1] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).

fof(f3,axiom,
    ! [X0,X1] : negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).

fof(f4,axiom,
    ! [X0] : negate(negate(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',double_negation) ).

fof(f5,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).

fof(f6,plain,
    b != add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),
    inference(reorient_equations,[],[f5]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
    inference(cnf_transformation,[],[f3]) ).

tcf(c_57,plain,
    ! [X0: $i] : negate(negate(X0)) = X0,
    inference(cnf_transformation,[],[f4]) ).

tcf(c_58,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
    inference(cnf_transformation,[],[f6]) ).

tcf(c_63,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
    inference(theory_normalisation,[status(thm)],[c_58,c_55,c_54]) ).

tcf(c_116,plain,
    ! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(X1,negate(X0))))) = X1,
    inference(superposition,[status(thm)],[c_54,c_56]) ).

tcf(c_159,plain,
    ! [X0: $i,X1: $i] : add(negate(add(X0,X1)),negate(add(X1,negate(X0)))) = negate(X1),
    inference(superposition,[status(thm)],[c_116,c_57]) ).

tcf(c_168,plain,
    negate(negate(b)) != b,
    inference(demodulation,[status(thm)],[c_63,c_159]) ).

tcf(c_169,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_168,c_57]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ROB002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Thu Sep 24 08:23:56 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40  Running UEQ theorem proving
% 0.10/0.40  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.41  
% 0.10/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41  
% 0.10/0.41  % Detected problem language: tptp
% 0.10/0.42  % Proving...
% 2.05/1.16  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.05/1.16  % SZS status Started for theBenchmark.p
% 2.05/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.05/1.16  
% 2.05/1.16  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.05/1.16  
% 2.05/1.16  % ------  iProver source info
% 2.05/1.16  
% 2.05/1.16  % git: date: 2026-07-19 20:42:38 +0200
% 2.05/1.16  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.05/1.16  % git: non_committed_changes: false
% 2.05/1.16  
% 2.05/1.16  % ------ Parsing...% successful
% 2.05/1.16  
% 2.05/1.16  
% 2.05/1.16  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.05/1.16  
% 2.05/1.16  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.05/1.16  
% 2.05/1.16  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.05/1.16  
% 2.05/1.16  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.05/1.16  % ------ Proving...
% 2.05/1.16  % ------ Problem Properties 
% 2.05/1.16  
% 2.05/1.16  % 
% 2.05/1.16  % clauses                               5
% 2.05/1.16  % conjectures                           1
% 2.05/1.16  % EPR                                   0
% 2.05/1.16  % Horn                                  5
% 2.05/1.16  % unary                                 5
% 2.05/1.16  % binary                                0
% 2.05/1.16  % lits                                  5
% 2.05/1.16  % lits eq                               5
% 2.05/1.16  % fd_pure                               0
% 2.05/1.16  % fd_pseudo                             0
% 2.05/1.16  % fd_cond                               0
% 2.05/1.16  % fd_pseudo_cond                        0
% 2.05/1.16  % AC symbols                            1
% 2.05/1.16  
% 2.05/1.16  % ------ Input Options Time Limit: Unbounded
% 2.05/1.16  
% 2.05/1.16  
% 2.05/1.16  % ------ 
% 2.05/1.16  % Current options:
% 2.05/1.16  % ------ 
% 2.05/1.16  
% 2.05/1.16  
% 2.05/1.16  % 
% 2.05/1.16  
% 2.05/1.16  % ------ Proving...
% 2.05/1.16  % 
% 2.05/1.16  
% 2.05/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.05/1.16  
% 2.05/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.05/1.17  
% 2.05/1.17  
%------------------------------------------------------------------------------