↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : HEN010-5 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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 : n020.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 6.17s 4.54s
% Output   : CNFRefutation 6.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   32 (  19 unt;   0 nHn;  14 RR)
%            Number of literals    :   49 (  48 equ;  19 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;   3 con; 0-2 aty)
%            Number of variables   :   70 (   8 sgn)

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

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

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

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

cnf(transitivity_of_divide_to_zero,axiom,
    ( divide(X1,X3) = zero
    | divide(X1,X2) != zero
    | divide(X2,X3) != zero ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_divide_to_zero) ).

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

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

cnf(c_0_7,axiom,
    ( X1 = X2
    | divide(X1,X2) != zero
    | divide(X2,X1) != zero ),
    divide_and_equal ).

cnf(c_0_8,axiom,
    divide(zero,X1) = zero,
    zero_is_smallest ).

cnf(c_0_9,axiom,
    ( divide(divide(X1,X3),X2) = zero
    | divide(divide(X1,X2),X3) != zero ),
    property_of_divide1 ).

cnf(c_0_10,axiom,
    divide(divide(X1,X2),X1) = zero,
    quotient_smaller_than_numerator ).

cnf(c_0_11,plain,
    ( X1 = zero
    | divide(X1,zero) != zero ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    divide(divide(X1,X1),X2) = zero,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,axiom,
    ( divide(X1,X3) = zero
    | divide(X1,X2) != zero
    | divide(X2,X3) != zero ),
    transitivity_of_divide_to_zero ).

cnf(c_0_14,plain,
    divide(X1,X1) = zero,
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ( divide(X1,X2) = zero
    | divide(X1,divide(X2,X3)) != zero ),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_16,plain,
    divide(divide(X1,divide(X1,X2)),X2) = zero,
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_17,axiom,
    divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
    quotient_property ).

cnf(c_0_18,plain,
    divide(divide(X1,divide(X1,divide(X2,X3))),X2) = zero,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_20,plain,
    ( divide(X1,divide(divide(X2,X3),X4)) = zero
    | divide(X1,divide(divide(X2,X4),divide(X3,X4))) != zero ),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

cnf(c_0_21,plain,
    divide(divide(X1,X2),divide(X1,divide(X2,X3))) = zero,
    inference(spm,[status(thm)],[c_0_9,c_0_18]) ).

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

cnf(c_0_23,plain,
    ( divide(X1,divide(X1,X2)) = X2
    | divide(X2,divide(X1,divide(X1,X2))) != zero ),
    inference(spm,[status(thm)],[c_0_7,c_0_16]) ).

cnf(c_0_24,plain,
    divide(divide(divide(X1,X2),X3),divide(divide(X1,X3),X2)) = zero,
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    ( divide(X1,divide(divide(X2,divide(X3,divide(X3,X4))),X4)) = zero
    | divide(X1,divide(X2,X4)) != zero ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_22]) ).

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

cnf(c_0_27,plain,
    ( divide(X1,X2) = X1
    | divide(X1,divide(X1,X2)) != zero ),
    inference(spm,[status(thm)],[c_0_7,c_0_10]) ).

cnf(c_0_28,plain,
    ( divide(X1,divide(divide(X2,X3),divide(X4,divide(X4,X3)))) = zero
    | divide(X1,divide(X2,X3)) != zero ),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
    prove_this ).

cnf(c_0_30,plain,
    divide(divide(X1,X2),divide(X3,divide(X3,X2))) = divide(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_14])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : HEN010-5 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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.33  % Computer : n020.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:09:50 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 6.17/4.54  % Version  : CSE_E---1.7
% 6.17/4.54  % Problem  : theBenchmark.p
% 6.17/4.54  % SZS status Unsatisfiable for theBenchmark.p
% 6.17/4.54  % SZS output start CNFRefutation
% See solution above
% 6.17/4.56  % Total time : 3.371s
%------------------------------------------------------------------------------