↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO269+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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:28:03 PM UTC 2026

% Result   : Theorem 0.11s 0.45s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  13 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :   80 (  29   ~;  35   |;   9   &)
%                                         (   5 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   57 (   0 sgn  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(a4_defns,axiom,
    ! [X1,X2] :
      ( equally_directed_lines(X1,X2)
    <=> ~ unequally_directed_lines(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a4_defns) ).

fof(ax5_basics,axiom,
    ! [X4] : equally_directed_lines(X4,X4),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax5_basics) ).

fof(con,conjecture,
    ! [X4] : equally_directed_opposite_lines(X4,reverse_line(X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(a5_defns,axiom,
    ! [X1,X2] :
      ( equally_directed_opposite_lines(X1,X2)
    <=> ~ unequally_directed_opposite_lines(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a5_defns) ).

fof(ax8_basics,axiom,
    ! [X4,X5] :
      ( unequally_directed_lines(X4,reverse_line(X5))
      | unequally_directed_lines(X4,X5) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax8_basics) ).

fof(ax6_basics,axiom,
    ! [X4,X5,X8] :
      ( unequally_directed_lines(X4,X5)
     => ( unequally_directed_lines(X5,X8)
        | unequally_directed_lines(X4,X8) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax6_basics) ).

fof(a1_defns,axiom,
    ! [X1,X2] :
      ( unequally_directed_opposite_lines(X1,X2)
    <=> unequally_directed_lines(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a1_defns) ).

fof(ax7_basics,axiom,
    ! [X4,X5,X8] :
      ( ( unequally_directed_lines(X4,reverse_line(X5))
        & unequally_directed_lines(X4,X5) )
     => ( ( unequally_directed_lines(X5,reverse_line(X8))
          & unequally_directed_lines(X5,X8) )
        | ( unequally_directed_lines(X4,reverse_line(X8))
          & unequally_directed_lines(X4,X8) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax7_basics) ).

fof(c_0_8,plain,
    ! [X1,X2] :
      ( equally_directed_lines(X1,X2)
    <=> ~ unequally_directed_lines(X1,X2) ),
    inference(fof_simplification,[status(thm)],[a4_defns]) ).

fof(c_0_9,plain,
    ! [X38,X39] :
      ( ( equally_directed_lines(X38,X39)
        | unequally_directed_lines(X38,X39) )
      & ( ~ unequally_directed_lines(X38,X39)
        | ~ equally_directed_lines(X38,X39) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

fof(c_0_10,plain,
    ! [X71] : equally_directed_lines(X71,X71),
    inference(variable_rename,[status(thm)],[ax5_basics]) ).

fof(c_0_11,negated_conjecture,
    ~ ! [X4] : equally_directed_opposite_lines(X4,reverse_line(X4)),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_12,plain,
    ! [X1,X2] :
      ( equally_directed_opposite_lines(X1,X2)
    <=> ~ unequally_directed_opposite_lines(X1,X2) ),
    inference(fof_simplification,[status(thm)],[a5_defns]) ).

cnf(c_0_13,plain,
    ( ~ unequally_directed_lines(X1,X2)
    | ~ equally_directed_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    equally_directed_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_15,plain,
    ! [X15,X16] :
      ( unequally_directed_lines(X15,reverse_line(X16))
      | unequally_directed_lines(X15,X16) ),
    inference(variable_rename,[status(thm)],[ax8_basics]) ).

fof(c_0_16,negated_conjecture,
    ~ equally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).

fof(c_0_17,plain,
    ! [X10,X11] :
      ( ( equally_directed_opposite_lines(X10,X11)
        | unequally_directed_opposite_lines(X10,X11) )
      & ( ~ unequally_directed_opposite_lines(X10,X11)
        | ~ equally_directed_opposite_lines(X10,X11) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).

fof(c_0_18,plain,
    ! [X40,X41,X42] :
      ( unequally_directed_lines(X41,X42)
      | unequally_directed_lines(X40,X42)
      | ~ unequally_directed_lines(X40,X41) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6_basics])])]) ).

cnf(c_0_19,plain,
    ~ unequally_directed_lines(X1,X1),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | unequally_directed_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_21,plain,
    ! [X34,X35] :
      ( ( unequally_directed_opposite_lines(X34,X35)
        | ~ unequally_directed_lines(X34,reverse_line(X35)) )
      & ( unequally_directed_lines(X34,reverse_line(X35))
        | ~ unequally_directed_opposite_lines(X34,X35) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])])]) ).

cnf(c_0_22,negated_conjecture,
    ~ equally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,plain,
    ( equally_directed_opposite_lines(X1,X2)
    | unequally_directed_opposite_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,plain,
    ( ~ unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X2,X3)
    | unequally_directed_lines(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_25,plain,
    unequally_directed_lines(reverse_line(X1),X1),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

fof(c_0_26,plain,
    ! [X12,X13,X14] :
      ( ( ~ unequally_directed_lines(X12,reverse_line(X13))
        | ~ unequally_directed_lines(X12,X13)
        | unequally_directed_lines(X12,reverse_line(X14))
        | unequally_directed_lines(X13,reverse_line(X14)) )
      & ( ~ unequally_directed_lines(X12,reverse_line(X13))
        | ~ unequally_directed_lines(X12,X13)
        | unequally_directed_lines(X12,reverse_line(X14))
        | unequally_directed_lines(X13,X14) )
      & ( ~ unequally_directed_lines(X12,reverse_line(X13))
        | ~ unequally_directed_lines(X12,X13)
        | unequally_directed_lines(X12,X14)
        | unequally_directed_lines(X13,reverse_line(X14)) )
      & ( ~ unequally_directed_lines(X12,reverse_line(X13))
        | ~ unequally_directed_lines(X12,X13)
        | unequally_directed_lines(X12,X14)
        | unequally_directed_lines(X13,X14) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7_basics])])])]) ).

cnf(c_0_27,plain,
    ( ~ unequally_directed_opposite_lines(X1,X2)
    | unequally_directed_lines(X1,reverse_line(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_28,negated_conjecture,
    unequally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(reverse_line(X1),X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,plain,
    ( ~ unequally_directed_lines(X3,reverse_line(X1))
    | ~ unequally_directed_lines(X3,X1)
    | unequally_directed_lines(X3,X2)
    | unequally_directed_lines(X1,reverse_line(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_31,negated_conjecture,
    unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk1_0))),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,plain,
    unequally_directed_lines(X1,reverse_line(X1)),
    inference(spm,[status(thm)],[c_0_19,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    ( unequally_directed_lines(esk1_0,X1)
    | unequally_directed_lines(reverse_line(esk1_0),reverse_line(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_33]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO269+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n004.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 : Sun Sep 20 15:00:20 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.45  % Version: 3.5.1
% 0.11/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45  % Starting sh5l with 300s (1) cores
% 0.11/0.45  % sh5l with pid 966240 completed with status 0
% 0.11/0.45  % Result found by sh5l
% 0.11/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45  % Starting sh5l with 300s (1) cores
% 0.11/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45  % Search class: FGHNS-FFMF21-SFFFFFNN
% 0.11/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45  % SubtermCWHack with pid 966247 completed with status 0
% 0.11/0.45  % Result found by SubtermCWHack
% 0.11/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45  % Starting sh5l with 300s (1) cores
% 0.11/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45  % Search class: FGHNS-FFMF21-SFFFFFNN
% 0.11/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45  % Preprocessing time       : 0.002 s
% 0.11/0.45  
% 0.11/0.45  % Proof found!
% 0.11/0.45  % SZS status Theorem
% 0.11/0.45  % SZS output start CNFRefutation
% See solution above
% 0.11/0.45  % Parsed axioms                        : 37
% 0.11/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.45  % Initial clauses                      : 67
% 0.11/0.45  % Removed in clause preprocessing      : 0
% 0.11/0.45  % Initial clauses in saturation        : 67
% 0.11/0.45  % Processed clauses                    : 89
% 0.11/0.45  % ...of these trivial                  : 0
% 0.11/0.45  % ...subsumed                          : 23
% 0.11/0.45  % ...remaining for further processing  : 66
% 0.11/0.45  % Other redundant clauses eliminated   : 0
% 0.11/0.45  % Clauses deleted for lack of memory   : 0
% 0.11/0.45  % Backward-subsumed                    : 5
% 0.11/0.45  % Backward-rewritten                   : 0
% 0.11/0.45  % Generated clauses                    : 112
% 0.11/0.45  % ...of the previous two non-redundant : 88
% 0.11/0.45  % ...aggressively subsumed             : 0
% 0.11/0.45  % Contextual simplify-reflections      : 0
% 0.11/0.45  % Paramodulations                      : 104
% 0.11/0.45  % Factorizations                       : 8
% 0.11/0.45  % NegExts                              : 0
% 0.11/0.45  % Equation resolutions                 : 0
% 0.11/0.45  % Disequality decompositions           : 0
% 0.11/0.45  % Total rewrite steps                  : 17
% 0.11/0.45  % ...of those cached                   : 3
% 0.11/0.45  % Propositional unsat checks           : 0
% 0.11/0.45  %    Propositional check models        : 0
% 0.11/0.45  %    Propositional check unsatisfiable : 0
% 0.11/0.45  %    Propositional clauses             : 0
% 0.11/0.45  %    Propositional clauses after purity: 0
% 0.11/0.45  %    Propositional unsat core size     : 0
% 0.11/0.45  %    Propositional preprocessing time  : 0.000
% 0.11/0.45  %    Propositional encoding time       : 0.000
% 0.11/0.45  %    Propositional solver time         : 0.000
% 0.11/0.45  %    Success case prop preproc time    : 0.000
% 0.11/0.45  %    Success case prop encoding time   : 0.000
% 0.11/0.45  %    Success case prop solver time     : 0.000
% 0.11/0.45  % Current number of processed clauses  : 61
% 0.11/0.45  %    Positive orientable unit clauses  : 12
% 0.11/0.45  %    Positive unorientable unit clauses: 0
% 0.11/0.45  %    Negative unit clauses             : 15
% 0.11/0.45  %    Non-unit-clauses                  : 34
% 0.11/0.45  % Current number of unprocessed clauses: 65
% 0.11/0.45  % ...number of literals in the above   : 225
% 0.11/0.45  % Current number of archived formulas  : 0
% 0.11/0.45  % Current number of archived clauses   : 5
% 0.11/0.45  % Clause-clause subsumption calls (NU) : 407
% 0.11/0.45  % Rec. Clause-clause subsumption calls : 350
% 0.11/0.45  % Non-unit clause-clause subsumptions  : 10
% 0.11/0.45  % Unit Clause-clause subsumption calls : 105
% 0.11/0.45  % Rewrite failures with RHS unbound    : 0
% 0.11/0.45  % BW rewrite match attempts            : 4
% 0.11/0.45  % BW rewrite match successes           : 0
% 0.11/0.45  % Condensation attempts                : 0
% 0.11/0.45  % Condensation successes               : 0
% 0.11/0.45  % Termbank termtop insertions          : 5333
% 0.11/0.45  % Search garbage collected termcells   : 718
% 0.11/0.45  
% 0.11/0.45  % -------------------------------------------------
% 0.11/0.45  % User time                : 0.009 s
% 0.11/0.45  % System time              : 0.004 s
% 0.11/0.45  % Total time               : 0.013 s
% 0.11/0.45  % Maximum resident set size: 3684 pages
% 0.11/0.45  
% 0.11/0.45  % -------------------------------------------------
% 0.11/0.45  % User time                : 0.010 s
% 0.11/0.45  % System time              : 0.010 s
% 0.11/0.45  % Total time               : 0.020 s
% 0.11/0.45  % Maximum resident set size: 4864 pages
% 0.11/0.45  % E exiting
%------------------------------------------------------------------------------