↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : HEN009-5 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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 : n023.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:34 PM UTC 2026

% Result   : Unsatisfiable 1.28s 1.74s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (  11 unt;   0 nHn;   9 RR)
%            Number of literals    :   30 (  29 equ;  13 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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   33 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(zero_is_smallest,axiom,
    divide(zero,X1) = zero,
    file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',property_of_divide1) ).

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(property_of_divide2,axiom,
    ( divide(divide(X3,X2),divide(X3,X1)) = zero
    | divide(X1,X2) != zero ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide2) ).

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

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

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

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

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

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

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

cnf(c_0_12,axiom,
    ( divide(divide(X3,X2),divide(X3,X1)) = zero
    | divide(X1,X2) != zero ),
    property_of_divide2 ).

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

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

cnf(c_0_15,plain,
    divide(divide(X1,divide(X1,X2)),X2) = zero,
    inference(spm,[status(thm)],[c_0_8,c_0_13]) ).

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

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

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : HEN009-5 : TPTP v9.2.1. Bugfixed v1.2.1.
% 0.12/0.13  % 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.34  % Computer : n023.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Mon May  4 19:10:38 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 1.28/1.74  % Version  : CSE_E---1.7
% 1.28/1.74  % Problem  : theBenchmark.p
% 1.28/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.74  % SZS output start CNFRefutation
% See solution above
% 1.28/1.74  % Total time : 1.374s
%------------------------------------------------------------------------------