↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : HEN010-4 : 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 : n006.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:35 PM UTC 2026

% Result   : Unsatisfiable 1.58s 1.81s
% Output   : CNFRefutation 1.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (  21 unt;   0 nHn;  11 RR)
%            Number of literals    :   43 (  16 equ;  14 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   52 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(quotient_less_equal2,axiom,
    ( less_equal(X1,X2)
    | divide(X1,X2) != zero ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).

cnf(x_divide_x_is_zero,axiom,
    divide(X1,X1) = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_x_is_zero) ).

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

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

cnf(property_of_divide1,axiom,
    ( less_equal(divide(X1,X3),X2)
    | ~ less_equal(divide(X1,X2),X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide1) ).

cnf(property_of_divide2,axiom,
    ( less_equal(divide(X3,X2),divide(X3,X1))
    | ~ less_equal(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide2) ).

cnf(quotient_smaller_than_numerator,axiom,
    less_equal(divide(X1,X2),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).

cnf(quotient_property,axiom,
    less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_property) ).

cnf(one_inversion_equals_three,axiom,
    divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_inversion_equals_three) ).

cnf(prove_property_of_inversion,negated_conjecture,
    divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_of_inversion) ).

cnf(c_0_10,axiom,
    ( less_equal(X1,X2)
    | divide(X1,X2) != zero ),
    quotient_less_equal2 ).

cnf(c_0_11,axiom,
    divide(X1,X1) = zero,
    x_divide_x_is_zero ).

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

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

cnf(c_0_14,axiom,
    ( less_equal(divide(X1,X3),X2)
    | ~ less_equal(divide(X1,X2),X3) ),
    property_of_divide1 ).

cnf(c_0_15,plain,
    less_equal(X1,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    ( X1 = zero
    | ~ less_equal(X1,zero) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    less_equal(divide(X1,divide(X1,X2)),X2),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,axiom,
    ( less_equal(divide(X3,X2),divide(X3,X1))
    | ~ less_equal(X1,X2) ),
    property_of_divide2 ).

cnf(c_0_19,axiom,
    less_equal(divide(X1,X2),X1),
    quotient_smaller_than_numerator ).

cnf(c_0_20,plain,
    divide(X1,divide(X1,zero)) = zero,
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    less_equal(divide(X1,X2),divide(X1,divide(X2,X3))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    less_equal(X1,divide(X1,zero)),
    inference(spm,[status(thm)],[c_0_10,c_0_20]) ).

cnf(c_0_23,plain,
    ( divide(X1,divide(X2,X3)) = divide(X1,X2)
    | ~ less_equal(divide(X1,divide(X2,X3)),divide(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_21]) ).

cnf(c_0_24,axiom,
    less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
    quotient_property ).

cnf(c_0_25,plain,
    divide(X1,zero) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_22]),c_0_19])]) ).

cnf(c_0_26,plain,
    divide(divide(X1,X2),X2) = divide(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_11]),c_0_25]) ).

cnf(c_0_27,axiom,
    divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
    one_inversion_equals_three ).

cnf(c_0_28,negated_conjecture,
    divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
    prove_property_of_inversion ).

cnf(c_0_29,plain,
    divide(divide(identity,X1),divide(identity,divide(identity,X1))) = divide(identity,X1),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : HEN010-4 : 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.15/0.32  % Computer : n006.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 19:09:31 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.58/1.81  % Version  : CSE_E---1.7
% 1.58/1.81  % Problem  : theBenchmark.p
% 1.58/1.81  % SZS status Unsatisfiable for theBenchmark.p
% 1.58/1.81  % SZS output start CNFRefutation
% See solution above
% 1.58/1.82  % Total time : 1.370s
%------------------------------------------------------------------------------