↑ 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  : ALG369-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 : n007.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:02:02 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.54s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (  20 unt;   0 nHn;  31 RR)
%            Number of literals    :   53 (   8 equ;  27 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_real__sgn__pos_0,axiom,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | c_HOL_Osgn__class_Osgn(X1,tc_RealDef_Oreal) = c_HOL_Oone__class_Oone(tc_RealDef_Oreal) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_real__sgn__pos_0) ).

cnf(cls_that_0,axiom,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal)
    | v_thesis____ ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_that_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ v_thesis____,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_sgn__pos_0,axiom,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(X1),X2,X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1)
    | c_HOL_Osgn__class_Osgn(X2,X1) = c_HOL_Oone__class_Oone(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_sgn__pos_0) ).

cnf(cls_m_I1_J_0,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_m____,tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_m_I1_J_0) ).

cnf(cls_ep_0,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_e,tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_ep_0) ).

cnf(clsarity_RealDef__Oreal__Ring__and__Field_Oordered__idom,axiom,
    class_Ring__and__Field_Oordered__idom(tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_RealDef__Oreal__Ring__and__Field_Oordered__idom) ).

cnf(cls_CHAINED_1,axiom,
    c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_1) ).

cnf(cls_CHAINED_0,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_sko__CHAINED__1(v_e,v_m____),tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0) ).

cnf(cls_CHAINED_2,axiom,
    c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_2) ).

cnf(c_0_10,plain,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | c_HOL_Osgn__class_Osgn(X1,tc_RealDef_Oreal) = c_HOL_Oone__class_Oone(tc_RealDef_Oreal) ),
    inference(fof_simplification,[status(thm)],[cls_real__sgn__pos_0]) ).

cnf(c_0_11,plain,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal)
    | v_thesis____ ),
    inference(fof_simplification,[status(thm)],[cls_that_0]) ).

cnf(c_0_12,negated_conjecture,
    ~ v_thesis____,
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_13,plain,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(X1),X2,X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1)
    | c_HOL_Osgn__class_Osgn(X2,X1) = c_HOL_Oone__class_Oone(X1) ),
    inference(fof_simplification,[status(thm)],[cls_sgn__pos_0]) ).

cnf(c_0_14,plain,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | c_HOL_Osgn__class_Osgn(X1,tc_RealDef_Oreal) = c_HOL_Oone__class_Oone(tc_RealDef_Oreal) ),
    c_0_10 ).

cnf(c_0_15,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_m____,tc_RealDef_Oreal),
    cls_m_I1_J_0 ).

cnf(c_0_16,plain,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal)
    | v_thesis____ ),
    c_0_11 ).

cnf(c_0_17,negated_conjecture,
    ~ v_thesis____,
    c_0_12 ).

cnf(c_0_18,plain,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(X1),X2,X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1)
    | c_HOL_Osgn__class_Osgn(X2,X1) = c_HOL_Oone__class_Oone(X1) ),
    c_0_13 ).

cnf(c_0_19,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_e,tc_RealDef_Oreal),
    cls_ep_0 ).

cnf(c_0_20,plain,
    c_HOL_Oone__class_Oone(tc_RealDef_Oreal) = c_HOL_Osgn__class_Osgn(v_m____,tc_RealDef_Oreal),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,axiom,
    class_Ring__and__Field_Oordered__idom(tc_RealDef_Oreal),
    clsarity_RealDef__Oreal__Ring__and__Field_Oordered__idom ).

cnf(c_0_22,axiom,
    c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal),
    cls_CHAINED_1 ).

cnf(c_0_23,plain,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
    inference(sr,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_24,plain,
    c_HOL_Osgn__class_Osgn(v_m____,tc_RealDef_Oreal) = c_HOL_Osgn__class_Osgn(v_e,tc_RealDef_Oreal),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).

cnf(c_0_25,plain,
    c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Osgn__class_Osgn(v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal),
    inference(rw,[status(thm)],[c_0_22,c_0_20]) ).

cnf(c_0_26,plain,
    ( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Osgn__class_Osgn(v_e,tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_20]),c_0_24]) ).

cnf(c_0_27,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_sko__CHAINED__1(v_e,v_m____),tc_RealDef_Oreal),
    cls_CHAINED_0 ).

cnf(c_0_28,axiom,
    c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal),
    cls_CHAINED_2 ).

cnf(c_0_29,plain,
    c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Osgn__class_Osgn(v_e,tc_RealDef_Oreal),tc_RealDef_Oreal),
    inference(rw,[status(thm)],[c_0_25,c_0_24]) ).

cnf(c_0_30,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG369-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.11/0.37  % Computer : n007.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 13:15:51 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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.18/0.54  % Version: 3.5.1
% 0.18/0.54  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.18/0.54  % Starting sh5l with 300s (1) cores
% 0.18/0.54  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1169069 completed with status 0
% 0.18/0.54  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.54  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.54  % No SInE strategy applied
% 0.18/0.54  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.18/0.54  % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.54  % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.54  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.54  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.18/0.54  % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.18/0.54  % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.18/0.54  % U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 1169086 completed with status 0
% 0.18/0.54  % Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 0.18/0.54  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.54  % No SInE strategy applied
% 0.18/0.54  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.18/0.54  % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.54  % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.54  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.54  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.18/0.54  % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.18/0.54  % Preprocessing time       : 0.005 s
% 0.18/0.54  % Presaturation interreduction done
% 0.18/0.54  
% 0.18/0.54  % Proof found!
% 0.18/0.54  % SZS status Unsatisfiable
% 0.18/0.54  % SZS output start CNFRefutation
% See solution above
% 0.18/0.54  % Parsed axioms                        : 626
% 0.18/0.54  % Removed by relevancy pruning/SinE    : 0
% 0.18/0.54  % Initial clauses                      : 626
% 0.18/0.54  % Removed in clause preprocessing      : 0
% 0.18/0.54  % Initial clauses in saturation        : 626
% 0.18/0.54  % Processed clauses                    : 1568
% 0.18/0.54  % ...of these trivial                  : 81
% 0.18/0.54  % ...subsumed                          : 487
% 0.18/0.54  % ...remaining for further processing  : 1000
% 0.18/0.54  % Other redundant clauses eliminated   : 51
% 0.18/0.54  % Clauses deleted for lack of memory   : 0
% 0.18/0.54  % Backward-subsumed                    : 3
% 0.18/0.54  % Backward-rewritten                   : 98
% 0.18/0.54  % Generated clauses                    : 2217
% 0.18/0.54  % ...of the previous two non-redundant : 1847
% 0.18/0.54  % ...aggressively subsumed             : 0
% 0.18/0.54  % Contextual simplify-reflections      : 0
% 0.18/0.54  % Paramodulations                      : 2157
% 0.18/0.54  % Factorizations                       : 2
% 0.18/0.54  % NegExts                              : 0
% 0.18/0.54  % Equation resolutions                 : 58
% 0.18/0.54  % Disequality decompositions           : 0
% 0.18/0.54  % Total rewrite steps                  : 2112
% 0.18/0.54  % ...of those cached                   : 1988
% 0.18/0.54  % Propositional unsat checks           : 0
% 0.18/0.54  %    Propositional check models        : 0
% 0.18/0.54  %    Propositional check unsatisfiable : 0
% 0.18/0.54  %    Propositional clauses             : 0
% 0.18/0.54  %    Propositional clauses after purity: 0
% 0.18/0.54  %    Propositional unsat core size     : 0
% 0.18/0.54  %    Propositional preprocessing time  : 0.000
% 0.18/0.54  %    Propositional encoding time       : 0.000
% 0.18/0.54  %    Propositional solver time         : 0.000
% 0.18/0.54  %    Success case prop preproc time    : 0.000
% 0.18/0.54  %    Success case prop encoding time   : 0.000
% 0.18/0.54  %    Success case prop solver time     : 0.000
% 0.18/0.54  % Current number of processed clauses  : 352
% 0.18/0.54  %    Positive orientable unit clauses  : 117
% 0.18/0.54  %    Positive unorientable unit clauses: 0
% 0.18/0.54  %    Negative unit clauses             : 36
% 0.18/0.54  %    Non-unit-clauses                  : 199
% 0.18/0.54  % Current number of unprocessed clauses: 1331
% 0.18/0.54  % ...number of literals in the above   : 3927
% 0.18/0.54  % Current number of archived formulas  : 0
% 0.18/0.54  % Current number of archived clauses   : 648
% 0.18/0.54  % Clause-clause subsumption calls (NU) : 41906
% 0.18/0.54  % Rec. Clause-clause subsumption calls : 17197
% 0.18/0.54  % Non-unit clause-clause subsumptions  : 260
% 0.18/0.54  % Unit Clause-clause subsumption calls : 233
% 0.18/0.54  % Rewrite failures with RHS unbound    : 0
% 0.18/0.54  % BW rewrite match attempts            : 58
% 0.18/0.54  % BW rewrite match successes           : 8
% 0.18/0.54  % Condensation attempts                : 0
% 0.18/0.54  % Condensation successes               : 0
% 0.18/0.54  % Termbank termtop insertions          : 55364
% 0.18/0.54  % Search garbage collected termcells   : 1423
% 0.18/0.54  
% 0.18/0.54  % -------------------------------------------------
% 0.18/0.54  % User time                : 0.074 s
% 0.18/0.54  % System time              : 0.008 s
% 0.18/0.54  % Total time               : 0.082 s
% 0.18/0.54  % Maximum resident set size: 4836 pages
% 0.18/0.54  
% 0.18/0.54  % -------------------------------------------------
% 0.18/0.54  % User time                : 0.344 s
% 0.18/0.54  % System time              : 0.036 s
% 0.18/0.54  % Total time               : 0.379 s
% 0.18/0.54  % Maximum resident set size: 5120 pages
% 0.18/0.54  % E exiting
%------------------------------------------------------------------------------