↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : HEN005-2 : TPTP v9.2.1. Released v1.0.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 : n029.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:28:30 PM UTC 2026

% Result   : Unsatisfiable 1.26s 1.72s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   32 (  20 unt;   0 nHn;  24 RR)
%            Number of literals    :   60 (   3 equ;  30 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   51 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(quotient_property,axiom,
    ( less_equal(X7,X8)
    | ~ quotient(X1,X2,X3)
    | ~ quotient(X2,X4,X5)
    | ~ quotient(X1,X4,X6)
    | ~ quotient(X6,X5,X7)
    | ~ quotient(X3,X4,X8) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).

cnf(x_divde_zero_is_x,axiom,
    quotient(X1,zero,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divde_zero_is_x) ).

cnf(quotient_less_equal,axiom,
    ( quotient(X1,X2,zero)
    | ~ less_equal(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).

cnf(yLEz,hypothesis,
    less_equal(y,z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',yLEz) ).

cnf(zero_divide_anything_is_zero,axiom,
    quotient(zero,X1,zero),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).

cnf(xLEy,hypothesis,
    less_equal(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xLEy) ).

cnf(closure,axiom,
    quotient(X1,X2,divide(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).

cnf(less_equal_and_equal,axiom,
    ( X1 = X2
    | ~ less_equal(X1,X2)
    | ~ less_equal(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).

cnf(zero_is_smallest,axiom,
    less_equal(zero,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).

cnf(less_equal_quotient,axiom,
    ( less_equal(X1,X2)
    | ~ quotient(X1,X2,zero) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).

cnf(prove_transitivity_of_less_equal,negated_conjecture,
    ~ less_equal(x,z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_transitivity_of_less_equal) ).

cnf(c_0_11,axiom,
    ( less_equal(X7,X8)
    | ~ quotient(X1,X2,X3)
    | ~ quotient(X2,X4,X5)
    | ~ quotient(X1,X4,X6)
    | ~ quotient(X6,X5,X7)
    | ~ quotient(X3,X4,X8) ),
    quotient_property ).

cnf(c_0_12,axiom,
    quotient(X1,zero,X1),
    x_divde_zero_is_x ).

cnf(c_0_13,axiom,
    ( quotient(X1,X2,zero)
    | ~ less_equal(X1,X2) ),
    quotient_less_equal ).

cnf(c_0_14,hypothesis,
    less_equal(y,z),
    yLEz ).

cnf(c_0_15,plain,
    ( less_equal(X1,X2)
    | ~ quotient(X3,X4,zero)
    | ~ quotient(X5,X4,X2)
    | ~ quotient(X6,X4,X1)
    | ~ quotient(X6,X3,X5) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    quotient(y,z,zero),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,hypothesis,
    ( less_equal(X1,X2)
    | ~ quotient(X3,z,X2)
    | ~ quotient(X4,z,X1)
    | ~ quotient(X4,y,X3) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,axiom,
    quotient(zero,X1,zero),
    zero_divide_anything_is_zero ).

cnf(c_0_19,hypothesis,
    less_equal(x,y),
    xLEy ).

cnf(c_0_20,hypothesis,
    ( less_equal(X1,zero)
    | ~ quotient(X2,y,zero)
    | ~ quotient(X2,z,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,hypothesis,
    quotient(x,y,zero),
    inference(spm,[status(thm)],[c_0_13,c_0_19]) ).

cnf(c_0_22,hypothesis,
    ( less_equal(X1,zero)
    | ~ quotient(x,z,X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,axiom,
    quotient(X1,X2,divide(X1,X2)),
    closure ).

cnf(c_0_24,axiom,
    ( X1 = X2
    | ~ less_equal(X1,X2)
    | ~ less_equal(X2,X1) ),
    less_equal_and_equal ).

cnf(c_0_25,hypothesis,
    less_equal(divide(x,z),zero),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,axiom,
    less_equal(zero,X1),
    zero_is_smallest ).

cnf(c_0_27,hypothesis,
    divide(x,z) = zero,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

cnf(c_0_28,axiom,
    ( less_equal(X1,X2)
    | ~ quotient(X1,X2,zero) ),
    less_equal_quotient ).

cnf(c_0_29,hypothesis,
    quotient(x,z,zero),
    inference(spm,[status(thm)],[c_0_23,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ~ less_equal(x,z),
    prove_transitivity_of_less_equal ).

cnf(c_0_31,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : HEN005-2 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12  % 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.15/0.33  % Computer : n029.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 19:10:14 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.26/1.72  % Version  : CSE_E---1.7
% 1.26/1.72  % Problem  : theBenchmark.p
% 1.26/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72  % SZS output start CNFRefutation
% See solution above
% 1.26/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------