↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM420-1.000 : TPTP v9.2.1. Released v4.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 : n024.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 04:57:16 PM UTC 2026

% Result   : Unsatisfiable 1.10s 1.62s
% Output   : CNFRefutation 1.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   39 (  22 unt;   5 nHn;  24 RR)
%            Number of literals    :   63 (  35 equ;  30 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (  17 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_34,negated_conjecture,
    ( less(n0,p__0)
    | ~ less(plus(n0,n1),p__0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_34) ).

cnf(axiom_8,axiom,
    plus(n0,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).

cnf(clause_44,negated_conjecture,
    ( less(n1,X1)
    | X1 != p__0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_44) ).

cnf(clause_24,negated_conjecture,
    ( ~ less(n0,X1)
    | ~ less(n0,p__0)
    | ~ less(X1,p__0)
    | plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).

cnf(axiom_30,axiom,
    less(n0,plus(X1,n1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_30) ).

cnf(clause_18,negated_conjecture,
    ( p__0 = plus(s_7(p__0),n1)
    | ~ less(n0,p__0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).

cnf(axiom_6,axiom,
    plus(X1,X2) = plus(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

cnf(axiom_20,axiom,
    times(n1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).

cnf(axiom_14,axiom,
    plus(n1,plus(X1,n1)) != n1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).

cnf(axiom_15,axiom,
    times(X1,X2) = times(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15) ).

cnf(clause_48,negated_conjecture,
    ( X1 = n1
    | times(s_1(X1),s_4(X1)) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_48) ).

cnf(clause_53,negated_conjecture,
    ( X1 = n1
    | s_1(X1) = p__0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_53) ).

cnf(c_0_12,negated_conjecture,
    ( less(n0,p__0)
    | ~ less(plus(n0,n1),p__0) ),
    clause_34 ).

cnf(c_0_13,axiom,
    plus(n0,X1) = X1,
    axiom_8 ).

cnf(c_0_14,negated_conjecture,
    ( less(n1,X1)
    | X1 != p__0 ),
    clause_44 ).

cnf(c_0_15,negated_conjecture,
    ( ~ less(n0,X1)
    | ~ less(n0,p__0)
    | ~ less(X1,p__0)
    | plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
    clause_24 ).

cnf(c_0_16,negated_conjecture,
    ( less(n0,p__0)
    | ~ less(n1,p__0) ),
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    less(n1,p__0),
    inference(er,[status(thm)],[c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( plus(X1,times(X2,p__0)) != times(X3,p__0)
    | ~ less(n0,p__0)
    | ~ less(X1,p__0)
    | ~ less(n0,X1) ),
    inference(rw,[status(thm)],[c_0_15,c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    less(n0,p__0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

cnf(c_0_20,axiom,
    less(n0,plus(X1,n1)),
    axiom_30 ).

cnf(c_0_21,negated_conjecture,
    ( plus(X1,times(X2,p__0)) != times(X3,p__0)
    | ~ less(X1,p__0)
    | ~ less(n0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).

cnf(c_0_22,plain,
    less(n0,n1),
    inference(spm,[status(thm)],[c_0_20,c_0_13]) ).

cnf(c_0_23,negated_conjecture,
    ( p__0 = plus(s_7(p__0),n1)
    | ~ less(n0,p__0) ),
    clause_18 ).

cnf(c_0_24,axiom,
    plus(X1,X2) = plus(X2,X1),
    axiom_6 ).

cnf(c_0_25,negated_conjecture,
    plus(n1,times(X1,p__0)) != times(X2,p__0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_22])]) ).

cnf(c_0_26,axiom,
    times(n1,X1) = X1,
    axiom_20 ).

cnf(c_0_27,axiom,
    plus(n1,plus(X1,n1)) != n1,
    axiom_14 ).

cnf(c_0_28,negated_conjecture,
    ( plus(n1,s_7(p__0)) = p__0
    | ~ less(n0,p__0) ),
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    times(X1,p__0) != plus(n1,p__0),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,axiom,
    times(X1,X2) = times(X2,X1),
    axiom_15 ).

cnf(c_0_31,negated_conjecture,
    ( X1 = n1
    | times(s_1(X1),s_4(X1)) = X1 ),
    clause_48 ).

cnf(c_0_32,negated_conjecture,
    ( X1 = n1
    | s_1(X1) = p__0 ),
    clause_53 ).

cnf(c_0_33,plain,
    plus(n1,plus(n1,X1)) != n1,
    inference(spm,[status(thm)],[c_0_27,c_0_24]) ).

cnf(c_0_34,negated_conjecture,
    plus(n1,s_7(p__0)) = p__0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_19])]) ).

cnf(c_0_35,negated_conjecture,
    times(p__0,X1) != plus(n1,p__0),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_36,negated_conjecture,
    ( times(p__0,s_4(X1)) = X1
    | X1 = n1 ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    plus(n1,p__0) != n1,
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36])]),c_0_37]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : NUM420-1.000 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.06  % 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.06/0.24  % Computer : n024.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Mon May  4 19:31:56 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 1.10/1.62  % Version  : CSE_E---1.7
% 1.10/1.62  % Problem  : theBenchmark.p
% 1.10/1.62  % SZS status Unsatisfiable for theBenchmark.p
% 1.10/1.62  % SZS output start CNFRefutation
% See solution above
% 1.10/1.62  % Total time : 1.362s
%------------------------------------------------------------------------------