↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : HEN005-5 : 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 : n017.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:31 PM UTC 2026

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

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

cnf(a_divide_b_is_zero,hypothesis,
    divide(a,b) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_divide_b_is_zero) ).

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

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

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

cnf(b_divide_c_is_zero,hypothesis,
    divide(b,c) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_divide_c_is_zero) ).

cnf(prove_transitivity_of_divide_to_zero,negated_conjecture,
    divide(a,c) != zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_transitivity_of_divide_to_zero) ).

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

cnf(c_0_8,hypothesis,
    divide(a,b) = zero,
    a_divide_b_is_zero ).

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

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

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

cnf(c_0_12,hypothesis,
    divide(divide(divide(a,X1),divide(b,X1)),zero) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).

cnf(c_0_13,hypothesis,
    divide(b,c) = zero,
    b_divide_c_is_zero ).

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

cnf(c_0_15,hypothesis,
    divide(divide(divide(a,c),zero),zero) = zero,
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,hypothesis,
    divide(divide(a,c),zero) = zero,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).

cnf(c_0_17,negated_conjecture,
    divide(a,c) != zero,
    prove_transitivity_of_divide_to_zero ).

cnf(c_0_18,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_16])]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : HEN005-5 : 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.16/0.32  % Computer : n017.cluster.edu
% 0.16/0.32  % Model    : x86_64 x86_64
% 0.16/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32  % Memory   : 8042.1875MB
% 0.16/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32  % CPULimit   : 300
% 0.16/0.32  % WCLimit    : 300
% 0.16/0.32  % DateTime   : Mon May  4 19:07:57 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.27/1.72  % Version  : CSE_E---1.7
% 1.27/1.72  % Problem  : theBenchmark.p
% 1.27/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72  % SZS output start CNFRefutation
% See solution above
% 1.27/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------