↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n004.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:27:08 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.45s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (   5 unt;   2 nHn;  22 RR)
%            Number of literals    :   46 (   9 equ;  26 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   31 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(theorem_2_7_1_68,negated_conjecture,
    ( ~ end_point(X2,sk14)
    | ~ end_point(X1,sk14)
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_7_1_68) ).

cnf(closed_defn_31,axiom,
    ( ~ end_point(X2,X1)
    | ~ closed(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',closed_defn_31) ).

cnf(closed_defn_32,axiom,
    ( closed(X1)
    | end_point(ax0_sk6(X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',closed_defn_32) ).

cnf(open_defn_33,axiom,
    ( ~ open(X1)
    | end_point(ax0_sk7(X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',open_defn_33) ).

cnf(c6_41,axiom,
    ( ~ end_point(X1,X2)
    | end_point(ax0_sk11(X1,X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',c6_41) ).

cnf(theorem_2_7_1_67,negated_conjecture,
    open(sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_7_1_67) ).

cnf(c6_42,axiom,
    ( X1 != ax0_sk11(X1,X2)
    | ~ end_point(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',c6_42) ).

cnf(c_0_7,negated_conjecture,
    ( ~ end_point(X2,sk14)
    | ~ end_point(X1,sk14)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[theorem_2_7_1_68]) ).

cnf(c_0_8,plain,
    ( ~ end_point(X2,X1)
    | ~ closed(X1) ),
    inference(fof_simplification,[status(thm)],[closed_defn_31]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ end_point(X2,sk14)
    | ~ end_point(X1,sk14)
    | X1 = X2 ),
    c_0_7 ).

cnf(c_0_10,axiom,
    ( closed(X1)
    | end_point(ax0_sk6(X1),X1) ),
    closed_defn_32 ).

cnf(c_0_11,plain,
    ( ~ end_point(X2,X1)
    | ~ closed(X1) ),
    c_0_8 ).

cnf(c_0_12,plain,
    ( ~ open(X1)
    | end_point(ax0_sk7(X1),X1) ),
    inference(fof_simplification,[status(thm)],[open_defn_33]) ).

cnf(c_0_13,plain,
    ( ~ end_point(X1,X2)
    | end_point(ax0_sk11(X1,X2),X2) ),
    inference(fof_simplification,[status(thm)],[c6_41]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ end_point(X1,sk14)
    | X1 = ax0_sk6(sk14) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_15,plain,
    ( ~ open(X1)
    | end_point(ax0_sk7(X1),X1) ),
    c_0_12 ).

cnf(c_0_16,negated_conjecture,
    open(sk14),
    theorem_2_7_1_67 ).

cnf(c_0_17,plain,
    ( X1 != ax0_sk11(X1,X2)
    | ~ end_point(X1,X2) ),
    inference(fof_simplification,[status(thm)],[c6_42]) ).

cnf(c_0_18,plain,
    ( ~ end_point(X1,X2)
    | end_point(ax0_sk11(X1,X2),X2) ),
    c_0_13 ).

cnf(c_0_19,negated_conjecture,
    ax0_sk7(sk14) = ax0_sk6(sk14),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_20,plain,
    ( X1 != ax0_sk11(X1,X2)
    | ~ end_point(X1,X2) ),
    c_0_17 ).

cnf(c_0_21,negated_conjecture,
    ( ~ end_point(X1,sk14)
    | ax0_sk11(X1,sk14) = ax0_sk6(sk14) ),
    inference(spm,[status(thm)],[c_0_14,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    end_point(ax0_sk6(sk14),sk14),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_16])]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO085-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n004.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 20 10:19:20 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/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.10/0.45  % Version: 3.5.1
% 0.10/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45  % Starting sh5l with 300s (1) cores
% 0.10/0.45  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 646770 completed with status 0
% 0.10/0.45  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.10/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45  % No SInE strategy applied
% 0.10/0.45  % Search class: FGHSF-FFMF31-SFFFFFNN
% 0.10/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.45  % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 166s (1) cores
% 0.10/0.45  % Starting new_bool_3 with 162s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 158s (1) cores
% 0.10/0.45  % SubtermCWHack with pid 646776 completed with status 0
% 0.10/0.45  % Result found by SubtermCWHack
% 0.10/0.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45  % No SInE strategy applied
% 0.10/0.45  % Search class: FGHSF-FFMF31-SFFFFFNN
% 0.10/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45  % Preprocessing time       : 0.002 s
% 0.10/0.45  
% 0.10/0.45  % Proof found!
% 0.10/0.45  % SZS status Unsatisfiable
% 0.10/0.45  % SZS output start CNFRefutation
% See solution above
% 0.10/0.45  % Parsed axioms                        : 50
% 0.10/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.10/0.45  % Initial clauses                      : 50
% 0.10/0.45  % Removed in clause preprocessing      : 5
% 0.10/0.45  % Initial clauses in saturation        : 45
% 0.10/0.45  % Processed clauses                    : 42
% 0.10/0.45  % ...of these trivial                  : 1
% 0.10/0.45  % ...subsumed                          : 6
% 0.10/0.45  % ...remaining for further processing  : 35
% 0.10/0.45  % Other redundant clauses eliminated   : 1
% 0.10/0.45  % Clauses deleted for lack of memory   : 0
% 0.10/0.45  % Backward-subsumed                    : 1
% 0.10/0.45  % Backward-rewritten                   : 1
% 0.10/0.45  % Generated clauses                    : 41
% 0.10/0.45  % ...of the previous two non-redundant : 30
% 0.10/0.45  % ...aggressively subsumed             : 0
% 0.10/0.45  % Contextual simplify-reflections      : 1
% 0.10/0.45  % Paramodulations                      : 40
% 0.10/0.45  % Factorizations                       : 0
% 0.10/0.45  % NegExts                              : 0
% 0.10/0.45  % Equation resolutions                 : 1
% 0.10/0.45  % Disequality decompositions           : 0
% 0.10/0.45  % Total rewrite steps                  : 13
% 0.10/0.45  % ...of those cached                   : 9
% 0.10/0.45  % Propositional unsat checks           : 0
% 0.10/0.45  %    Propositional check models        : 0
% 0.10/0.45  %    Propositional check unsatisfiable : 0
% 0.10/0.45  %    Propositional clauses             : 0
% 0.10/0.45  %    Propositional clauses after purity: 0
% 0.10/0.45  %    Propositional unsat core size     : 0
% 0.10/0.45  %    Propositional preprocessing time  : 0.000
% 0.10/0.45  %    Propositional encoding time       : 0.000
% 0.10/0.45  %    Propositional solver time         : 0.000
% 0.10/0.45  %    Success case prop preproc time    : 0.000
% 0.10/0.45  %    Success case prop encoding time   : 0.000
% 0.10/0.45  %    Success case prop solver time     : 0.000
% 0.10/0.45  % Current number of processed clauses  : 33
% 0.10/0.45  %    Positive orientable unit clauses  : 7
% 0.10/0.45  %    Positive unorientable unit clauses: 0
% 0.10/0.45  %    Negative unit clauses             : 2
% 0.10/0.45  %    Non-unit-clauses                  : 24
% 0.10/0.45  % Current number of unprocessed clauses: 27
% 0.10/0.45  % ...number of literals in the above   : 104
% 0.10/0.45  % Current number of archived formulas  : 0
% 0.10/0.45  % Current number of archived clauses   : 2
% 0.10/0.45  % Clause-clause subsumption calls (NU) : 134
% 0.10/0.45  % Rec. Clause-clause subsumption calls : 118
% 0.10/0.45  % Non-unit clause-clause subsumptions  : 7
% 0.10/0.45  % Unit Clause-clause subsumption calls : 11
% 0.10/0.45  % Rewrite failures with RHS unbound    : 0
% 0.10/0.45  % BW rewrite match attempts            : 2
% 0.10/0.45  % BW rewrite match successes           : 1
% 0.10/0.45  % Condensation attempts                : 0
% 0.10/0.45  % Condensation successes               : 0
% 0.10/0.45  % Termbank termtop insertions          : 2023
% 0.10/0.45  % Search garbage collected termcells   : 132
% 0.10/0.45  
% 0.10/0.45  % -------------------------------------------------
% 0.10/0.45  % User time                : 0.005 s
% 0.10/0.45  % System time              : 0.003 s
% 0.10/0.45  % Total time               : 0.008 s
% 0.10/0.45  % Maximum resident set size: 3680 pages
% 0.10/0.45  
% 0.10/0.45  % -------------------------------------------------
% 0.10/0.45  % User time                : 0.021 s
% 0.10/0.45  % System time              : 0.013 s
% 0.10/0.45  % Total time               : 0.034 s
% 0.10/0.45  % Maximum resident set size: 4864 pages
% 0.10/0.45  % E exiting
%------------------------------------------------------------------------------