↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n002.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:43 PM UTC 2026

% Result   : Unsatisfiable 1.25s 1.72s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;   8 RR)
%            Number of literals    :   17 (  16 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_base_step,negated_conjecture,
    negate(add(a,negate(add(b,multiply(one,add(a,c)))))) != c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_base_step) ).

cnf(one_times_x,axiom,
    multiply(one,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-1.ax',one_times_x) ).

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

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

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

cnf(condition,hypothesis,
    negate(add(a,negate(b))) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).

cnf(c_0_6,negated_conjecture,
    negate(add(a,negate(add(b,multiply(one,add(a,c)))))) != c,
    prove_base_step ).

cnf(c_0_7,axiom,
    multiply(one,X1) = X1,
    one_times_x ).

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

cnf(c_0_9,axiom,
    add(add(X1,X2),X3) = add(X1,add(X2,X3)),
    associativity_of_add ).

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

cnf(c_0_11,hypothesis,
    negate(add(a,negate(b))) = c,
    condition ).

cnf(c_0_12,negated_conjecture,
    negate(add(a,negate(add(b,add(a,c))))) != c,
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

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

cnf(c_0_14,hypothesis,
    negate(add(c,negate(add(a,b)))) = a,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]) ).

cnf(c_0_15,negated_conjecture,
    negate(add(a,negate(add(a,add(c,b))))) != c,
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_13]),c_0_8]),c_0_8]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : ROB011-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n002.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 01:51:47 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.25/1.72  % Version  : CSE_E---1.7
% 1.25/1.72  % Problem  : theBenchmark.p
% 1.25/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.72  % SZS output start CNFRefutation
% See solution above
% 1.25/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------