↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n014.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:42 PM UTC 2026

% Result   : Unsatisfiable 2.64s 1.26s
% Output   : CNFRefutation 2.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  19 unt;   0 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    7 (   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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn  26   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).

fof(f4,axiom,
    negate(add(a,negate(add(b,c)))) = negate(add(a,add(b,negate(c)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).

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

fof(f6,plain,
    a != add(a,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,
    negate(add(a,add(b,negate(c)))) = negate(add(a,negate(add(b,c)))),
    inference(cnf_transformation,[],[f4]) ).

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

tcf(c_110,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(X0,add(X1,X2)) = add(X1,add(X0,X2)),
    inference(superposition,[status(thm)],[c_55,c_54]) ).

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

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

tcf(c_129,plain,
    ! [X0: $i,X1: $i,X2: $i] : negate(add(negate(add(X0,add(X1,X2))),negate(add(X0,add(X1,negate(X2)))))) = add(X0,X1),
    inference(theory_normalisation,[status(thm)],[c_122,c_55,c_54]) ).

tcf(c_380,plain,
    negate(add(negate(add(b,add(a,c))),negate(add(a,add(b,negate(c)))))) = a,
    inference(superposition,[status(thm)],[c_57,c_117]) ).

tcf(c_381,plain,
    negate(add(negate(add(a,add(b,c))),negate(add(a,add(b,negate(c)))))) = a,
    inference(theory_normalisation,[status(thm)],[c_380,c_55,c_54]) ).

tcf(c_657,plain,
    add(a,b) = a,
    inference(demodulation,[status(thm)],[c_381,c_129]) ).

tcf(c_658,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_657,c_58]) ).


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