↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : ROB030-1 : TPTP v9.2.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% 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 : Tue May  5 05:05:45 PM UTC 2026

% Result   : Unsatisfiable 0.23s 1.61s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   24 (  14 unt;   0 nHn;  11 RR)
%            Number of literals    :   36 (  35 equ;  14 neg)
%            Maximal clause size   :    3 (   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   :   49 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(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(prove_absorption_within_negation,negated_conjecture,
    negate(add(X1,X2)) != negate(X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_absorption_within_negation) ).

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

cnf(absorbtion,hypothesis,
    add(c,d) = d,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorbtion) ).

cnf(i_0_5,axiom,
    negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
    robbins_axiom,
    [final] ).

cnf(i_0_6,axiom,
    add(add(X1,X2),X3) = add(X1,add(X2,X3)),
    associativity_of_add,
    [final] ).

cnf(i_0_7,negated_conjecture,
    negate(add(X1,X2)) != negate(X2),
    prove_absorption_within_negation,
    [final] ).

cnf(i_0_8,axiom,
    add(X1,X2) = add(X2,X1),
    commutativity_of_add,
    [final] ).

cnf(i_0_9,hypothesis,
    add(c,d) = d,
    absorbtion,
    [final] ).

cnf(i_0_10,axiom,
    X1 = X1 ).

cnf(i_0_11,axiom,
    ( X1 = X2
    | X2 != X1 ) ).

cnf(i_0_12,axiom,
    ( X1 = X2
    | X1 != X3
    | X3 != X2 ) ).

cnf(i_0_13,axiom,
    ( X1 != X2
    | negate(X1) = negate(X2) ) ).

cnf(i_0_14,axiom,
    ( X1 != X2
    | add(X1,X3) = add(X2,X3) ) ).

cnf(i_0_15,axiom,
    ( X1 != X2
    | add(X3,X1) = add(X3,X2) ) ).

cnf(i_0_10_001,axiom,
    X1 = X1 ).

cnf(i_0_11_002,axiom,
    ( X1 = X2
    | X2 != X1 ) ).

cnf(i_0_12_003,axiom,
    ( X1 = X2
    | X1 != X3
    | X3 != X2 ) ).

cnf(i_0_13_004,axiom,
    ( X1 != X2
    | negate(X1) = negate(X2) ) ).

cnf(i_0_14_005,axiom,
    ( X1 != X2
    | add(X1,X3) = add(X2,X3) ) ).

cnf(i_0_15_006,axiom,
    ( X1 != X2
    | add(X3,X1) = add(X3,X2) ) ).

cnf(i_0_16,plain,
    add(X1,add(X2,X3)) = add(add(X1,X2),X3),
    inference(scs_inference,[],[i_0_6,i_0_11]) ).

cnf(i_0_17,plain,
    $false,
    inference(scs_inference,[],[i_0_7,i_0_6,i_0_9,i_0_11,i_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : ROB030-1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.11  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32  % Computer : n023.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 01:53:23 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 0.23/1.61  % Version  : CSE_E---1.7
% 0.23/1.61  % Problem  : theBenchmark.p
% 0.23/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 0.23/1.61  % SZS output start CNFRefutation
% See solution above
% 0.23/1.62  % Total time : 1.271s
%------------------------------------------------------------------------------