↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO094-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 : n002.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:10 PM UTC 2026

% Result   : Unsatisfiable 0.24s 15.64s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   49 (  15 unt;   7 nHn;  47 RR)
%            Number of literals    :  122 (   0 equ;  71 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   88 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(end_point_defn_14,axiom,
    ( ~ incident_c(X1,X4)
    | ~ incident_c(X1,X3)
    | ~ part_of(X4,X2)
    | ~ part_of(X3,X2)
    | ~ end_point(X1,X2)
    | part_of(X4,X3)
    | part_of(X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_14) ).

cnf(meet_defn_25,axiom,
    ( ~ meet(X1,X2,X3)
    | incident_c(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',meet_defn_25) ).

cnf(proposition_2_14_3_70,negated_conjecture,
    end_point(sk17,sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_3_70) ).

cnf(proposition_2_14_3_67,negated_conjecture,
    meet(sk17,sk15,sk16),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_3_67) ).

cnf(meet_defn_24,axiom,
    ( ~ meet(X1,X2,X3)
    | incident_c(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',meet_defn_24) ).

cnf(proposition_2_14_3_69,negated_conjecture,
    part_of(sk16,sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_3_69) ).

cnf(meet_defn_26,axiom,
    ( ~ incident_c(X4,X3)
    | ~ incident_c(X4,X2)
    | ~ meet(X1,X2,X3)
    | end_point(X4,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',meet_defn_26) ).

cnf(part_of_defn_1,axiom,
    ( ~ incident_c(X3,X1)
    | ~ part_of(X1,X2)
    | incident_c(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',part_of_defn_1) ).

cnf(proposition_2_14_3_68,negated_conjecture,
    part_of(sk15,sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_3_68) ).

cnf(inner_point_defn_21,axiom,
    ( ~ inner_point(X1,X2)
    | incident_c(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',inner_point_defn_21) ).

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

cnf(meet_defn_27,axiom,
    ( ~ incident_c(X4,X3)
    | ~ incident_c(X4,X2)
    | ~ meet(X1,X2,X3)
    | end_point(X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',meet_defn_27) ).

cnf(c3_37,axiom,
    inner_point(ax0_sk8(X1),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',c3_37) ).

cnf(c_0_13,plain,
    ( ~ incident_c(X1,X4)
    | ~ incident_c(X1,X3)
    | ~ part_of(X4,X2)
    | ~ part_of(X3,X2)
    | ~ end_point(X1,X2)
    | part_of(X4,X3)
    | part_of(X3,X4) ),
    inference(fof_simplification,[status(thm)],[end_point_defn_14]) ).

cnf(c_0_14,plain,
    ( ~ meet(X1,X2,X3)
    | incident_c(X1,X3) ),
    inference(fof_simplification,[status(thm)],[meet_defn_25]) ).

cnf(c_0_15,plain,
    ( ~ incident_c(X1,X4)
    | ~ incident_c(X1,X3)
    | ~ part_of(X4,X2)
    | ~ part_of(X3,X2)
    | ~ end_point(X1,X2)
    | part_of(X4,X3)
    | part_of(X3,X4) ),
    c_0_13 ).

cnf(c_0_16,negated_conjecture,
    end_point(sk17,sk14),
    proposition_2_14_3_70 ).

cnf(c_0_17,plain,
    ( ~ meet(X1,X2,X3)
    | incident_c(X1,X3) ),
    c_0_14 ).

cnf(c_0_18,negated_conjecture,
    meet(sk17,sk15,sk16),
    proposition_2_14_3_67 ).

cnf(c_0_19,plain,
    ( ~ meet(X1,X2,X3)
    | incident_c(X1,X2) ),
    inference(fof_simplification,[status(thm)],[meet_defn_24]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ part_of(X2,sk14)
    | ~ part_of(X1,sk14)
    | ~ incident_c(sk17,X2)
    | ~ incident_c(sk17,X1)
    | part_of(X2,X1)
    | part_of(X1,X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    incident_c(sk17,sk16),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    part_of(sk16,sk14),
    proposition_2_14_3_69 ).

cnf(c_0_23,plain,
    ( ~ meet(X1,X2,X3)
    | incident_c(X1,X2) ),
    c_0_19 ).

cnf(c_0_24,plain,
    ( ~ incident_c(X4,X3)
    | ~ incident_c(X4,X2)
    | ~ meet(X1,X2,X3)
    | end_point(X4,X2) ),
    inference(fof_simplification,[status(thm)],[meet_defn_26]) ).

cnf(c_0_25,plain,
    ( ~ incident_c(X3,X1)
    | ~ part_of(X1,X2)
    | incident_c(X3,X2) ),
    inference(fof_simplification,[status(thm)],[part_of_defn_1]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ part_of(X1,sk14)
    | ~ incident_c(sk17,X1)
    | part_of(sk16,X1)
    | part_of(X1,sk16) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_27,negated_conjecture,
    incident_c(sk17,sk15),
    inference(spm,[status(thm)],[c_0_23,c_0_18]) ).

cnf(c_0_28,negated_conjecture,
    part_of(sk15,sk14),
    proposition_2_14_3_68 ).

cnf(c_0_29,plain,
    ( ~ incident_c(X4,X3)
    | ~ incident_c(X4,X2)
    | ~ meet(X1,X2,X3)
    | end_point(X4,X2) ),
    c_0_24 ).

cnf(c_0_30,plain,
    ( ~ inner_point(X1,X2)
    | incident_c(X1,X2) ),
    inference(fof_simplification,[status(thm)],[inner_point_defn_21]) ).

cnf(c_0_31,plain,
    ( ~ end_point(X1,X2)
    | ~ inner_point(X1,X2) ),
    inference(fof_simplification,[status(thm)],[inner_point_defn_22]) ).

cnf(c_0_32,plain,
    ( ~ incident_c(X3,X1)
    | ~ part_of(X1,X2)
    | incident_c(X3,X2) ),
    c_0_25 ).

cnf(c_0_33,negated_conjecture,
    ( part_of(sk15,sk16)
    | part_of(sk16,sk15) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ incident_c(X1,sk15)
    | ~ incident_c(X1,sk16)
    | end_point(X1,sk15) ),
    inference(spm,[status(thm)],[c_0_29,c_0_18]) ).

cnf(c_0_35,plain,
    ( ~ inner_point(X1,X2)
    | incident_c(X1,X2) ),
    c_0_30 ).

cnf(c_0_36,plain,
    ( ~ end_point(X1,X2)
    | ~ inner_point(X1,X2) ),
    c_0_31 ).

cnf(c_0_37,negated_conjecture,
    ( ~ incident_c(X1,sk15)
    | part_of(sk16,sk15)
    | incident_c(X1,sk16) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ incident_c(X1,sk16)
    | ~ inner_point(X1,sk15) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_39,plain,
    ( ~ incident_c(X4,X3)
    | ~ incident_c(X4,X2)
    | ~ meet(X1,X2,X3)
    | end_point(X4,X3) ),
    inference(fof_simplification,[status(thm)],[meet_defn_27]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ inner_point(X1,sk15)
    | part_of(sk16,sk15) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_38]) ).

cnf(c_0_41,axiom,
    inner_point(ax0_sk8(X1),X1),
    c3_37 ).

cnf(c_0_42,plain,
    ( ~ incident_c(X4,X3)
    | ~ incident_c(X4,X2)
    | ~ meet(X1,X2,X3)
    | end_point(X4,X3) ),
    c_0_39 ).

cnf(c_0_43,negated_conjecture,
    part_of(sk16,sk15),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ incident_c(X1,sk15)
    | ~ incident_c(X1,sk16)
    | end_point(X1,sk16) ),
    inference(spm,[status(thm)],[c_0_42,c_0_18]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ incident_c(X1,sk16)
    | incident_c(X1,sk15) ),
    inference(spm,[status(thm)],[c_0_32,c_0_43]) ).

cnf(c_0_46,negated_conjecture,
    ( ~ incident_c(X1,sk16)
    | end_point(X1,sk16) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_47,negated_conjecture,
    ~ inner_point(X1,sk16),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_35]),c_0_36]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_47,c_0_41]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GEO094-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/15.47  % Computer : n002.cluster.edu
% 0.20/15.47  % Model    : x86_64 x86_64
% 0.20/15.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/15.47  % Memory   : 8046.5625MB
% 0.20/15.47  % OS       : Linux 6.8.0-71-generic
% 0.20/15.47  % CPULimit : 300
% 0.20/15.47  % WCLimit  : 300
% 0.20/15.47  % DateTime : Sun Sep 20 10:45:32 UTC 2026
% 0.20/15.47  % CPUTime  : 
% 0.20/15.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/15.52  Running first-order theorem proving
% 0.24/15.52  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.24/15.64  % Version: 3.5.1
% 0.24/15.64  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/15.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/15.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/15.64  % Starting new_bool_3 with 300s (1) cores
% 0.24/15.64  % Starting new_bool_1 with 300s (1) cores
% 0.24/15.64  % Starting sh5l with 300s (1) cores
% 0.24/15.64  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 810012 completed with status 0
% 0.24/15.64  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.24/15.64  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/15.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/15.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/15.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/15.64  % No SInE strategy applied
% 0.24/15.64  % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.24/15.64  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/15.64  % Starting SubtermCWHack with 136s (1) cores
% 0.24/15.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/15.64  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.24/15.64  % Starting new_bool_3 with 189s (1) cores
% 0.24/15.64  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.24/15.64  % G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with pid 810019 completed with status 0
% 0.24/15.64  % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S0Y
% 0.24/15.64  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/15.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/15.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/15.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/15.64  % No SInE strategy applied
% 0.24/15.64  % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.24/15.64  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/15.64  % Starting SubtermCWHack with 136s (1) cores
% 0.24/15.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/15.64  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.24/15.64  % Preprocessing time       : 0.003 s
% 0.24/15.64  
% 0.24/15.64  % Proof found!
% 0.24/15.64  % SZS status Unsatisfiable
% 0.24/15.64  % SZS output start CNFRefutation
% See solution above
% 0.24/15.64  % Parsed axioms                        : 52
% 0.24/15.64  % Removed by relevancy pruning/SinE    : 0
% 0.24/15.64  % Initial clauses                      : 52
% 0.24/15.64  % Removed in clause preprocessing      : 5
% 0.24/15.64  % Initial clauses in saturation        : 47
% 0.24/15.64  % Processed clauses                    : 425
% 0.24/15.64  % ...of these trivial                  : 0
% 0.24/15.64  % ...subsumed                          : 161
% 0.24/15.64  % ...remaining for further processing  : 264
% 0.24/15.64  % Other redundant clauses eliminated   : 14
% 0.24/15.64  % Clauses deleted for lack of memory   : 0
% 0.24/15.64  % Backward-subsumed                    : 53
% 0.24/15.64  % Backward-rewritten                   : 11
% 0.24/15.64  % Generated clauses                    : 1249
% 0.24/15.64  % ...of the previous two non-redundant : 1073
% 0.24/15.64  % ...aggressively subsumed             : 0
% 0.24/15.64  % Contextual simplify-reflections      : 19
% 0.24/15.64  % Paramodulations                      : 1213
% 0.24/15.64  % Factorizations                       : 22
% 0.24/15.64  % NegExts                              : 0
% 0.24/15.64  % Equation resolutions                 : 14
% 0.24/15.64  % Disequality decompositions           : 0
% 0.24/15.64  % Total rewrite steps                  : 156
% 0.24/15.64  % ...of those cached                   : 141
% 0.24/15.64  % Propositional unsat checks           : 0
% 0.24/15.64  %    Propositional check models        : 0
% 0.24/15.64  %    Propositional check unsatisfiable : 0
% 0.24/15.64  %    Propositional clauses             : 0
% 0.24/15.64  %    Propositional clauses after purity: 0
% 0.24/15.64  %    Propositional unsat core size     : 0
% 0.24/15.64  %    Propositional preprocessing time  : 0.000
% 0.24/15.64  %    Propositional encoding time       : 0.000
% 0.24/15.64  %    Propositional solver time         : 0.000
% 0.24/15.64  %    Success case prop preproc time    : 0.000
% 0.24/15.64  %    Success case prop encoding time   : 0.000
% 0.24/15.64  %    Success case prop solver time     : 0.000
% 0.24/15.64  % Current number of processed clauses  : 196
% 0.24/15.64  %    Positive orientable unit clauses  : 16
% 0.24/15.64  %    Positive unorientable unit clauses: 0
% 0.24/15.64  %    Negative unit clauses             : 8
% 0.24/15.64  %    Non-unit-clauses                  : 172
% 0.24/15.64  % Current number of unprocessed clauses: 660
% 0.24/15.64  % ...number of literals in the above   : 3650
% 0.24/15.64  % Current number of archived formulas  : 0
% 0.24/15.64  % Current number of archived clauses   : 64
% 0.24/15.64  % Clause-clause subsumption calls (NU) : 8494
% 0.24/15.64  % Rec. Clause-clause subsumption calls : 3925
% 0.24/15.64  % Non-unit clause-clause subsumptions  : 183
% 0.24/15.64  % Unit Clause-clause subsumption calls : 438
% 0.24/15.64  % Rewrite failures with RHS unbound    : 0
% 0.24/15.64  % BW rewrite match attempts            : 22
% 0.24/15.64  % BW rewrite match successes           : 5
% 0.24/15.64  % Condensation attempts                : 0
% 0.24/15.64  % Condensation successes               : 0
% 0.24/15.64  % Termbank termtop insertions          : 22785
% 0.24/15.64  % Search garbage collected termcells   : 126
% 0.24/15.64  
% 0.24/15.64  % -------------------------------------------------
% 0.24/15.64  % User time                : 0.073 s
% 0.24/15.64  % System time              : 0.008 s
% 0.24/15.64  % Total time               : 0.080 s
% 0.24/15.64  % Maximum resident set size: 3680 pages
% 0.24/15.64  
% 0.24/15.64  % -------------------------------------------------
% 0.24/15.64  % User time                : 0.257 s
% 0.24/15.64  % System time              : 0.029 s
% 0.24/15.64  % Total time               : 0.286 s
% 0.24/15.64  % Maximum resident set size: 4608 pages
% 0.24/15.64  % E exiting
%------------------------------------------------------------------------------