↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : ALG340-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:01:58 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_order__root_1,axiom,
    ( ~ class_Ring__and__Field_Oidom(X1)
    | c_Polynomial_Opoly(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X2,X1) = c_HOL_Ozero__class_Ozero(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_order__root_1) ).

cnf(cls_norm__zero_0,axiom,
    ( ~ class_RealVector_Oreal__normed__vector(X1)
    | c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_norm__zero_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),X1,tc_RealDef_Oreal) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Oidom,axiom,
    class_Ring__and__Field_Oidom(tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Oidom) ).

cnf(clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector,axiom,
    class_RealVector_Oreal__normed__vector(tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector) ).

cnf(cls_real__less__def_0,axiom,
    ( ~ c_HOL_Oord__class_Oless(X1,X2,tc_RealDef_Oreal)
    | c_lessequals(X1,X2,tc_RealDef_Oreal) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_real__less__def_0) ).

cnf(cls_real__of__preal__zero__less_0,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),c_RealDef_Oreal__of__preal(X1),tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_real__of__preal__zero__less_0) ).

cnf(c_0_7,plain,
    ( ~ class_Ring__and__Field_Oidom(X1)
    | c_Polynomial_Opoly(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X2,X1) = c_HOL_Ozero__class_Ozero(X1) ),
    inference(fof_simplification,[status(thm)],[cls_order__root_1]) ).

cnf(c_0_8,plain,
    ( ~ class_RealVector_Oreal__normed__vector(X1)
    | c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal) ),
    inference(fof_simplification,[status(thm)],[cls_norm__zero_0]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),X1,tc_RealDef_Oreal) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).

cnf(c_0_10,plain,
    ( ~ class_Ring__and__Field_Oidom(X1)
    | c_Polynomial_Opoly(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X2,X1) = c_HOL_Ozero__class_Ozero(X1) ),
    c_0_7 ).

cnf(c_0_11,axiom,
    class_Ring__and__Field_Oidom(tc_Complex_Ocomplex),
    clsarity_Complex__Ocomplex__Ring__and__Field_Oidom ).

cnf(c_0_12,plain,
    ( ~ class_RealVector_Oreal__normed__vector(X1)
    | c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal) ),
    c_0_8 ).

cnf(c_0_13,axiom,
    class_RealVector_Oreal__normed__vector(tc_Complex_Ocomplex),
    clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector ).

cnf(c_0_14,plain,
    ( ~ c_HOL_Oord__class_Oless(X1,X2,tc_RealDef_Oreal)
    | c_lessequals(X1,X2,tc_RealDef_Oreal) ),
    inference(fof_simplification,[status(thm)],[cls_real__less__def_0]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),X1,tc_RealDef_Oreal) ),
    c_0_9 ).

cnf(c_0_16,plain,
    c_Polynomial_Opoly(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),X1,tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,plain,
    c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,plain,
    ( ~ c_HOL_Oord__class_Oless(X1,X2,tc_RealDef_Oreal)
    | c_lessequals(X1,X2,tc_RealDef_Oreal) ),
    c_0_14 ).

cnf(c_0_19,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),c_RealDef_Oreal__of__preal(X1),tc_RealDef_Oreal),
    cls_real__of__preal__zero__less_0 ).

cnf(c_0_20,negated_conjecture,
    ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]) ).

cnf(c_0_21,plain,
    $false,
    inference(sr,[status(thm)],[c_0_19,c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG340-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36  % Computer : n013.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.36  % CPULimit : 300
% 0.12/0.36  % WCLimit  : 300
% 0.12/0.36  % DateTime : Mon Sep 21 13:16:05 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.41  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.88/0.60  % Version: 3.5.1
% 0.88/0.60  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.60  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.88/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.88/0.60  % Starting sh5l with 300s (1) cores
% 0.88/0.60  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 846087 completed with status 0
% 0.88/0.60  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.88/0.60  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.60  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.60  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.88/0.60  % No SInE strategy applied
% 0.88/0.60  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.88/0.60  % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.88/0.60  % Starting SubtermCWHack with 136s (1) cores
% 0.88/0.60  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.88/0.60  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.88/0.60  % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.88/0.60  % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.88/0.60  % U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 846095 completed with status 0
% 0.88/0.60  % Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 0.88/0.60  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.60  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.60  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.88/0.60  % No SInE strategy applied
% 0.88/0.60  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.88/0.60  % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.88/0.60  % Starting SubtermCWHack with 136s (1) cores
% 0.88/0.60  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.88/0.60  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.88/0.60  % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.88/0.60  % Preprocessing time       : 0.010 s
% 0.88/0.60  % Presaturation interreduction done
% 0.88/0.60  
% 0.88/0.60  % Proof found!
% 0.88/0.60  % SZS status Unsatisfiable
% 0.88/0.60  % SZS output start CNFRefutation
% See solution above
% 0.88/0.60  % Parsed axioms                        : 552
% 0.88/0.60  % Removed by relevancy pruning/SinE    : 0
% 0.88/0.60  % Initial clauses                      : 552
% 0.88/0.60  % Removed in clause preprocessing      : 0
% 0.88/0.60  % Initial clauses in saturation        : 552
% 0.88/0.60  % Processed clauses                    : 1131
% 0.88/0.60  % ...of these trivial                  : 3
% 0.88/0.60  % ...subsumed                          : 135
% 0.88/0.60  % ...remaining for further processing  : 993
% 0.88/0.60  % Other redundant clauses eliminated   : 0
% 0.88/0.60  % Clauses deleted for lack of memory   : 0
% 0.88/0.60  % Backward-subsumed                    : 9
% 0.88/0.60  % Backward-rewritten                   : 1
% 0.88/0.60  % Generated clauses                    : 556
% 0.88/0.60  % ...of the previous two non-redundant : 465
% 0.88/0.60  % ...aggressively subsumed             : 0
% 0.88/0.60  % Contextual simplify-reflections      : 2
% 0.88/0.60  % Paramodulations                      : 546
% 0.88/0.60  % Factorizations                       : 2
% 0.88/0.60  % NegExts                              : 0
% 0.88/0.60  % Equation resolutions                 : 1
% 0.88/0.60  % Disequality decompositions           : 0
% 0.88/0.60  % Total rewrite steps                  : 204
% 0.88/0.60  % ...of those cached                   : 165
% 0.88/0.60  % Propositional unsat checks           : 0
% 0.88/0.60  %    Propositional check models        : 0
% 0.88/0.60  %    Propositional check unsatisfiable : 0
% 0.88/0.60  %    Propositional clauses             : 0
% 0.88/0.60  %    Propositional clauses after purity: 0
% 0.88/0.60  %    Propositional unsat core size     : 0
% 0.88/0.60  %    Propositional preprocessing time  : 0.000
% 0.88/0.60  %    Propositional encoding time       : 0.000
% 0.88/0.60  %    Propositional solver time         : 0.000
% 0.88/0.60  %    Success case prop preproc time    : 0.000
% 0.88/0.60  %    Success case prop encoding time   : 0.000
% 0.88/0.60  %    Success case prop solver time     : 0.000
% 0.88/0.60  % Current number of processed clauses  : 484
% 0.88/0.60  %    Positive orientable unit clauses  : 257
% 0.88/0.60  %    Positive unorientable unit clauses: 1
% 0.88/0.60  %    Negative unit clauses             : 10
% 0.88/0.60  %    Non-unit-clauses                  : 216
% 0.88/0.60  % Current number of unprocessed clauses: 372
% 0.88/0.60  % ...number of literals in the above   : 1349
% 0.88/0.60  % Current number of archived formulas  : 0
% 0.88/0.60  % Current number of archived clauses   : 509
% 0.88/0.60  % Clause-clause subsumption calls (NU) : 42664
% 0.88/0.60  % Rec. Clause-clause subsumption calls : 21902
% 0.88/0.60  % Non-unit clause-clause subsumptions  : 95
% 0.88/0.60  % Unit Clause-clause subsumption calls : 746
% 0.88/0.60  % Rewrite failures with RHS unbound    : 0
% 0.88/0.60  % BW rewrite match attempts            : 666
% 0.88/0.60  % BW rewrite match successes           : 15
% 0.88/0.60  % Condensation attempts                : 0
% 0.88/0.60  % Condensation successes               : 0
% 0.88/0.60  % Termbank termtop insertions          : 35132
% 0.88/0.60  % Search garbage collected termcells   : 1200
% 0.88/0.60  
% 0.88/0.60  % -------------------------------------------------
% 0.88/0.60  % User time                : 0.115 s
% 0.88/0.60  % System time              : 0.015 s
% 0.88/0.60  % Total time               : 0.130 s
% 0.88/0.60  % Maximum resident set size: 4736 pages
% 0.88/0.60  
% 0.88/0.60  % -------------------------------------------------
% 0.88/0.60  % User time                : 0.523 s
% 0.88/0.60  % System time              : 0.050 s
% 0.88/0.60  % Total time               : 0.573 s
% 0.88/0.60  % Maximum resident set size: 5120 pages
% 0.88/0.60  % E exiting
%------------------------------------------------------------------------------