TSTP Solution File: ROB023-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : ROB023-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n020.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:07:30 EDT 2023

% Result   : Unsatisfiable 0.17s 0.77s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   38 (  34 unt;   4 typ;   0 def)
%            Number of atoms       :   34 (  33 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   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   :   55 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    add: ( $i * $i ) > $i ).

tff(decl_23,type,
    negate: $i > $i ).

tff(decl_24,type,
    a: $i ).

tff(decl_25,type,
    b: $i ).

cnf(associativity_of_add,axiom,
    add(add(X1,X2),X3) = add(X1,add(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).

cnf(x_plus_x_is_x,hypothesis,
    add(X1,X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_plus_x_is_x) ).

cnf(robbins_axiom,axiom,
    negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).

cnf(commutativity_of_add,axiom,
    add(X1,X2) = add(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).

cnf(prove_huntingtons_axiom,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_0_5,axiom,
    add(add(X1,X2),X3) = add(X1,add(X2,X3)),
    associativity_of_add ).

cnf(c_0_6,hypothesis,
    add(X1,X1) = X1,
    x_plus_x_is_x ).

cnf(c_0_7,axiom,
    negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
    robbins_axiom ).

cnf(c_0_8,hypothesis,
    add(X1,add(X1,X2)) = add(X1,X2),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,axiom,
    add(X1,X2) = add(X2,X1),
    commutativity_of_add ).

cnf(c_0_10,hypothesis,
    negate(add(negate(add(X1,X2)),negate(add(X1,negate(add(X1,X2)))))) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_9]) ).

cnf(c_0_12,hypothesis,
    negate(add(X1,negate(add(X1,negate(add(X1,X2)))))) = negate(add(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_10]),c_0_9]) ).

cnf(c_0_13,plain,
    negate(add(X1,negate(add(X1,add(negate(X2),negate(add(X1,X2))))))) = negate(add(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_9]),c_0_5]),c_0_9]) ).

cnf(c_0_14,plain,
    negate(add(negate(add(X1,X2)),negate(add(negate(X1),X2)))) = X2,
    inference(spm,[status(thm)],[c_0_11,c_0_9]) ).

cnf(c_0_15,plain,
    add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_5]) ).

cnf(c_0_16,hypothesis,
    negate(add(X1,add(negate(X2),negate(add(X1,X2))))) = negate(add(X1,negate(add(X1,X2)))),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,hypothesis,
    negate(add(negate(add(X1,X2)),negate(add(X1,add(negate(X1),X2))))) = add(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_15]) ).

cnf(c_0_18,hypothesis,
    negate(add(negate(X1),add(X2,negate(add(X2,X1))))) = negate(add(X2,negate(add(X2,X1)))),
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_19,hypothesis,
    add(negate(X1),negate(add(X1,negate(negate(X1))))) = negate(add(X1,negate(negate(X1)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]),c_0_9]),c_0_14]),c_0_9]) ).

cnf(c_0_20,hypothesis,
    negate(add(negate(negate(X1)),negate(add(X1,negate(X1))))) = negate(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_9]),c_0_9]) ).

cnf(c_0_21,plain,
    add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
    inference(spm,[status(thm)],[c_0_9,c_0_5]) ).

cnf(c_0_22,hypothesis,
    negate(add(X1,add(negate(X2),negate(add(X2,X1))))) = negate(add(X1,negate(add(X2,X1)))),
    inference(spm,[status(thm)],[c_0_16,c_0_9]) ).

cnf(c_0_23,hypothesis,
    add(negate(X1),add(negate(add(X1,negate(negate(X1)))),X2)) = add(negate(add(X1,negate(negate(X1)))),X2),
    inference(spm,[status(thm)],[c_0_5,c_0_19]) ).

cnf(c_0_24,hypothesis,
    negate(add(negate(X1),negate(add(X1,add(negate(X1),negate(negate(X1))))))) = negate(negate(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_21]),c_0_9]),c_0_15]),c_0_9]) ).

cnf(c_0_25,hypothesis,
    add(X1,negate(negate(X1))) = negate(negate(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_5]),c_0_9]),c_0_17]),c_0_5]),c_0_9]),c_0_24]) ).

cnf(c_0_26,hypothesis,
    negate(add(negate(X1),negate(add(X1,negate(X1))))) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_27,hypothesis,
    add(negate(X1),negate(add(X1,negate(X1)))) = negate(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_5]),c_0_9]),c_0_8]) ).

cnf(c_0_28,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
    prove_huntingtons_axiom ).

cnf(c_0_29,hypothesis,
    negate(negate(X1)) = X1,
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,plain,
    negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
    inference(spm,[status(thm)],[c_0_7,c_0_9]) ).

cnf(c_0_31,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
    inference(spm,[status(thm)],[c_0_28,c_0_9]) ).

cnf(c_0_32,hypothesis,
    add(negate(add(X1,X2)),negate(add(X2,negate(X1)))) = negate(X2),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : ROB023-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.11  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32  % Computer : n020.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Aug 28 06:53:44 EDT 2023
% 0.11/0.32  % CPUTime  : 
% 0.17/0.55  start to proof: theBenchmark
% 0.17/0.77  % Version  : CSE_E---1.5
% 0.17/0.77  % Problem  : theBenchmark.p
% 0.17/0.77  % Proof found
% 0.17/0.77  % SZS status Theorem for theBenchmark.p
% 0.17/0.77  % SZS output start Proof
% See solution above
% 0.17/0.78  % Total time : 0.214000 s
% 0.17/0.78  % SZS output end Proof
% 0.17/0.78  % Total time : 0.216000 s
%------------------------------------------------------------------------------