↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : ALG436-1 : TPTP v9.2.1. Released v4.1.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 : 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:08:43 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_CHAINED_0,axiom,
    ( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
    | ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
    | ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_CHAINED_0_01,axiom,
    ( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
    | ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
    | c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(c_0_4,axiom,
    ( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
    | ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    cls_CHAINED_0 ).

cnf(c_0_5,negated_conjecture,
    ( ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
    | ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    cls_conjecture_0 ).

cnf(c_0_6,axiom,
    ( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
    | ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    cls_CHAINED_0_01 ).

cnf(c_0_7,plain,
    ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(csr,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
    | c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
    cls_conjecture_1 ).

cnf(c_0_9,plain,
    ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(sr,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_8,c_0_9]),c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : ALG436-1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.11  % 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.32  % Computer : n023.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   : Tue May  5 10:34:38 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 1.28/1.78  % Version  : CSE_E---1.7
% 1.28/1.78  % Problem  : theBenchmark.p
% 1.28/1.78  % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.78  % SZS output start CNFRefutation
% See solution above
% 1.28/1.78  % Total time : 1.424s
%------------------------------------------------------------------------------