↑ 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  : ALG341-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.20s 0.52s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   15 (   8 unt;   0 nHn;  12 RR)
%            Number of literals    :   25 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   16 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_real__le__trans_0,axiom,
    ( ~ c_lessequals(X1,X3,tc_RealDef_Oreal)
    | ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
    | c_lessequals(X1,X2,tc_RealDef_Oreal) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_real__le__trans_0) ).

cnf(cls_CHAINED_0_01,axiom,
    c_lessequals(c_RealVector_Onorm__class_Onorm(v_z____,tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).

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

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

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(c_0_5,plain,
    ( ~ c_lessequals(X1,X3,tc_RealDef_Oreal)
    | ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
    | c_lessequals(X1,X2,tc_RealDef_Oreal) ),
    inference(fof_simplification,[status(thm)],[cls_real__le__trans_0]) ).

cnf(c_0_6,plain,
    ( ~ c_lessequals(X1,X3,tc_RealDef_Oreal)
    | ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
    | c_lessequals(X1,X2,tc_RealDef_Oreal) ),
    c_0_5 ).

cnf(c_0_7,axiom,
    c_lessequals(c_RealVector_Onorm__class_Onorm(v_z____,tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal),
    cls_CHAINED_0_01 ).

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

cnf(c_0_9,negated_conjecture,
    ~ c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_10,plain,
    ( ~ c_lessequals(X1,c_RealVector_Onorm__class_Onorm(v_z____,tc_Complex_Ocomplex),tc_RealDef_Oreal)
    | c_lessequals(X1,v_r,tc_RealDef_Oreal) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ class_RealVector_Oreal__normed__vector(X1)
    | c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(X2,X1),tc_RealDef_Oreal) ),
    c_0_8 ).

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

cnf(c_0_13,negated_conjecture,
    ~ c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
    c_0_9 ).

cnf(c_0_14,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG341-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.38  % Computer : n013.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 13:15:50 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  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.20/0.52  % Version: 3.5.1
% 0.20/0.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  % Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  % Starting new_bool_1 with 300s (1) cores
% 0.20/0.52  % Starting sh5l with 300s (1) cores
% 0.20/0.52  % new_bool_3 with pid 845678 completed with status 0
% 0.20/0.52  % Result found by new_bool_3
% 0.20/0.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  % Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  % Search class: FGUSF-FFLM32-MFFFFFNN
% 0.20/0.52  % partial match(1): FGUSF-FFMM32-MFFFFFNN
% 0.20/0.52  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.52  % SubtermCWHack with pid 845682 completed with status 0
% 0.20/0.52  % Result found by SubtermCWHack
% 0.20/0.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  % Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  % Search class: FGUSF-FFLM32-MFFFFFNN
% 0.20/0.52  % partial match(1): FGUSF-FFMM32-MFFFFFNN
% 0.20/0.52  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.52  % Preprocessing time       : 0.003 s
% 0.20/0.52  
% 0.20/0.52  % Proof found!
% 0.20/0.52  % SZS status Unsatisfiable
% 0.20/0.52  % SZS output start CNFRefutation
% See solution above
% 0.20/0.52  % Parsed axioms                        : 595
% 0.20/0.52  % Removed by relevancy pruning/SinE    : 431
% 0.20/0.52  % Initial clauses                      : 164
% 0.20/0.52  % Removed in clause preprocessing      : 0
% 0.20/0.52  % Initial clauses in saturation        : 164
% 0.20/0.52  % Processed clauses                    : 326
% 0.20/0.52  % ...of these trivial                  : 72
% 0.20/0.52  % ...subsumed                          : 96
% 0.20/0.52  % ...remaining for further processing  : 158
% 0.20/0.52  % Other redundant clauses eliminated   : 66
% 0.20/0.52  % Clauses deleted for lack of memory   : 0
% 0.20/0.52  % Backward-subsumed                    : 0
% 0.20/0.52  % Backward-rewritten                   : 9
% 0.20/0.52  % Generated clauses                    : 988
% 0.20/0.52  % ...of the previous two non-redundant : 453
% 0.20/0.52  % ...aggressively subsumed             : 0
% 0.20/0.52  % Contextual simplify-reflections      : 0
% 0.20/0.52  % Paramodulations                      : 918
% 0.20/0.52  % Factorizations                       : 2
% 0.20/0.52  % NegExts                              : 0
% 0.20/0.52  % Equation resolutions                 : 68
% 0.20/0.52  % Disequality decompositions           : 0
% 0.20/0.52  % Total rewrite steps                  : 1175
% 0.20/0.52  % ...of those cached                   : 1028
% 0.20/0.52  % Propositional unsat checks           : 0
% 0.20/0.52  %    Propositional check models        : 0
% 0.20/0.52  %    Propositional check unsatisfiable : 0
% 0.20/0.52  %    Propositional clauses             : 0
% 0.20/0.52  %    Propositional clauses after purity: 0
% 0.20/0.52  %    Propositional unsat core size     : 0
% 0.20/0.52  %    Propositional preprocessing time  : 0.000
% 0.20/0.52  %    Propositional encoding time       : 0.000
% 0.20/0.52  %    Propositional solver time         : 0.000
% 0.20/0.52  %    Success case prop preproc time    : 0.000
% 0.20/0.52  %    Success case prop encoding time   : 0.000
% 0.20/0.52  %    Success case prop solver time     : 0.000
% 0.20/0.52  % Current number of processed clauses  : 149
% 0.20/0.52  %    Positive orientable unit clauses  : 80
% 0.20/0.52  %    Positive unorientable unit clauses: 6
% 0.20/0.52  %    Negative unit clauses             : 1
% 0.20/0.52  %    Non-unit-clauses                  : 62
% 0.20/0.52  % Current number of unprocessed clauses: 266
% 0.20/0.52  % ...number of literals in the above   : 550
% 0.20/0.52  % Current number of archived formulas  : 0
% 0.20/0.52  % Current number of archived clauses   : 9
% 0.20/0.52  % Clause-clause subsumption calls (NU) : 376
% 0.20/0.52  % Rec. Clause-clause subsumption calls : 366
% 0.20/0.52  % Non-unit clause-clause subsumptions  : 77
% 0.20/0.52  % Unit Clause-clause subsumption calls : 14
% 0.20/0.52  % Rewrite failures with RHS unbound    : 0
% 0.20/0.52  % BW rewrite match attempts            : 212
% 0.20/0.52  % BW rewrite match successes           : 39
% 0.20/0.52  % Condensation attempts                : 0
% 0.20/0.52  % Condensation successes               : 0
% 0.20/0.52  % Termbank termtop insertions          : 17358
% 0.20/0.52  % Search garbage collected termcells   : 1601
% 0.20/0.52  
% 0.20/0.52  % -------------------------------------------------
% 0.20/0.52  % User time                : 0.020 s
% 0.20/0.52  % System time              : 0.005 s
% 0.20/0.52  % Total time               : 0.025 s
% 0.20/0.52  % Maximum resident set size: 4296 pages
% 0.20/0.52  
% 0.20/0.52  % -------------------------------------------------
% 0.20/0.52  % User time                : 0.033 s
% 0.20/0.52  % System time              : 0.012 s
% 0.20/0.52  % Total time               : 0.045 s
% 0.20/0.52  % Maximum resident set size: 4864 pages
% 0.20/0.52  % E exiting
%------------------------------------------------------------------------------