↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO231+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n003.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:54 PM UTC 2026

% Result   : Theorem 0.10s 0.43s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   49 (  14 unt;   0 def)
%            Number of atoms       :  104 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   91 (  36   ~;  37   |;   9   &)
%                                         (   5 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   76 (   2 sgn  42   !;   0   ?)

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

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

fof(con,conjecture,
    ! [X4,X5,X8] :
      ( ( equally_directed_lines(X4,X8)
        & equally_directed_opposite_lines(X4,X5) )
     => equally_directed_opposite_lines(X5,X8) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

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

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

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/sandbox2/benchmark/Axioms/GEO009+0.ax',ax6_basics) ).

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

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

fof(ax11_basics,axiom,
    ! [X4,X5] :
      ~ ( left_convergent_lines(X4,reverse_line(X5))
        | left_convergent_lines(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).

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

fof(c_0_10,plain,
    ! [X12,X13] :
      ( ( equally_directed_opposite_lines(X12,X13)
        | unequally_directed_opposite_lines(X12,X13) )
      & ( ~ unequally_directed_opposite_lines(X12,X13)
        | ~ equally_directed_opposite_lines(X12,X13) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

fof(c_0_11,plain,
    ! [X19,X20] :
      ( ( unequally_directed_opposite_lines(X19,X20)
        | ~ unequally_directed_lines(X19,reverse_line(X20)) )
      & ( unequally_directed_lines(X19,reverse_line(X20))
        | ~ unequally_directed_opposite_lines(X19,X20) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])])]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X4,X5,X8] :
        ( ( equally_directed_lines(X4,X8)
          & equally_directed_opposite_lines(X4,X5) )
       => equally_directed_opposite_lines(X5,X8) ),
    inference(assume_negation,[status(cth)],[con]) ).

cnf(c_0_13,plain,
    ( ~ unequally_directed_opposite_lines(X1,X2)
    | ~ equally_directed_opposite_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

fof(c_0_15,negated_conjecture,
    ( ~ equally_directed_opposite_lines(esk2_0,esk3_0)
    & equally_directed_lines(esk1_0,esk3_0)
    & equally_directed_opposite_lines(esk1_0,esk2_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

cnf(c_0_16,plain,
    ( ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ equally_directed_opposite_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    equally_directed_opposite_lines(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_18,plain,
    ! [X27,X28] :
      ( unequally_directed_lines(X27,reverse_line(X28))
      | unequally_directed_lines(X27,X28) ),
    inference(variable_rename,[status(thm)],[ax8_basics]) ).

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

fof(c_0_20,plain,
    ! [X21,X22,X23] :
      ( unequally_directed_lines(X22,X23)
      | unequally_directed_lines(X21,X23)
      | ~ unequally_directed_lines(X21,X22) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6_basics])])]) ).

cnf(c_0_21,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

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

fof(c_0_23,plain,
    ! [X14,X15] :
      ( ( equally_directed_lines(X14,X15)
        | unequally_directed_lines(X14,X15) )
      & ( ~ unequally_directed_lines(X14,X15)
        | ~ equally_directed_lines(X14,X15) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).

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

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

cnf(c_0_26,negated_conjecture,
    unequally_directed_lines(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

cnf(c_0_28,plain,
    equally_directed_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ( unequally_directed_lines(esk1_0,X1)
    | unequally_directed_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ~ unequally_directed_lines(X1,X1),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(esk2_0,X2)
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    equally_directed_lines(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_33,negated_conjecture,
    ( unequally_directed_lines(esk1_0,X1)
    | unequally_directed_lines(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

fof(c_0_34,plain,
    ! [X45,X46] :
      ( left_convergent_lines(X45,reverse_line(X46))
      | left_convergent_lines(X45,X46)
      | ~ unequally_directed_lines(X45,reverse_line(X46))
      | ~ unequally_directed_lines(X45,X46) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_basics])])]) ).

fof(c_0_35,plain,
    ! [X47,X48] :
      ( ~ left_convergent_lines(X47,reverse_line(X48))
      & ~ left_convergent_lines(X47,X48) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11_basics])])]) ).

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

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

cnf(c_0_38,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,esk3_0),
    inference(spm,[status(thm)],[c_0_27,c_0_32]) ).

cnf(c_0_39,negated_conjecture,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(esk1_0,X2)
    | unequally_directed_lines(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_33]) ).

cnf(c_0_40,plain,
    ( ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2)
    | left_convergent_lines(X1,reverse_line(X2))
    | left_convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_41,plain,
    ~ left_convergent_lines(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_42,negated_conjecture,
    ~ equally_directed_opposite_lines(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_43,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | equally_directed_opposite_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_44,negated_conjecture,
    ( unequally_directed_lines(X1,esk2_0)
    | unequally_directed_lines(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_45,plain,
    ( ~ unequally_directed_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_40,c_0_41]),c_0_41]) ).

cnf(c_0_46,negated_conjecture,
    unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    unequally_directed_lines(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_30,c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO231+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n003.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 14:12:01 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.41  Running first-order theorem proving
% 0.10/0.41  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.43  % Version: 3.5.1
% 0.10/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43  % Starting sh5l with 300s (1) cores
% 0.10/0.43  % new_bool_3 with pid 1977763 completed with status 0
% 0.10/0.43  % Result found by new_bool_3
% 0.10/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.10/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43  % SubtermCWHack with pid 1977768 completed with status 0
% 0.10/0.43  % Result found by SubtermCWHack
% 0.10/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.10/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43  % Preprocessing time       : 0.002 s
% 0.10/0.43  
% 0.10/0.43  % Proof found!
% 0.10/0.43  % SZS status Theorem
% 0.10/0.43  % SZS output start CNFRefutation
% See solution above
% 0.10/0.43  % Parsed axioms                        : 37
% 0.10/0.43  % Removed by relevancy pruning/SinE    : 17
% 0.10/0.43  % Initial clauses                      : 33
% 0.10/0.43  % Removed in clause preprocessing      : 0
% 0.10/0.43  % Initial clauses in saturation        : 33
% 0.10/0.43  % Processed clauses                    : 77
% 0.10/0.43  % ...of these trivial                  : 0
% 0.10/0.43  % ...subsumed                          : 21
% 0.10/0.43  % ...remaining for further processing  : 56
% 0.10/0.43  % Other redundant clauses eliminated   : 0
% 0.10/0.43  % Clauses deleted for lack of memory   : 0
% 0.10/0.43  % Backward-subsumed                    : 2
% 0.10/0.43  % Backward-rewritten                   : 0
% 0.10/0.43  % Generated clauses                    : 194
% 0.10/0.43  % ...of the previous two non-redundant : 132
% 0.10/0.43  % ...aggressively subsumed             : 0
% 0.10/0.43  % Contextual simplify-reflections      : 0
% 0.10/0.43  % Paramodulations                      : 164
% 0.10/0.43  % Factorizations                       : 30
% 0.10/0.43  % NegExts                              : 0
% 0.10/0.43  % Equation resolutions                 : 0
% 0.10/0.43  % Disequality decompositions           : 0
% 0.10/0.43  % Total rewrite steps                  : 41
% 0.10/0.43  % ...of those cached                   : 35
% 0.10/0.43  % Propositional unsat checks           : 0
% 0.10/0.43  %    Propositional check models        : 0
% 0.10/0.43  %    Propositional check unsatisfiable : 0
% 0.10/0.43  %    Propositional clauses             : 0
% 0.10/0.43  %    Propositional clauses after purity: 0
% 0.10/0.43  %    Propositional unsat core size     : 0
% 0.10/0.43  %    Propositional preprocessing time  : 0.000
% 0.10/0.43  %    Propositional encoding time       : 0.000
% 0.10/0.43  %    Propositional solver time         : 0.000
% 0.10/0.43  %    Success case prop preproc time    : 0.000
% 0.10/0.43  %    Success case prop encoding time   : 0.000
% 0.10/0.43  %    Success case prop solver time     : 0.000
% 0.10/0.43  % Current number of processed clauses  : 54
% 0.10/0.43  %    Positive orientable unit clauses  : 10
% 0.10/0.43  %    Positive unorientable unit clauses: 0
% 0.10/0.43  %    Negative unit clauses             : 8
% 0.10/0.43  %    Non-unit-clauses                  : 36
% 0.10/0.43  % Current number of unprocessed clauses: 80
% 0.10/0.43  % ...number of literals in the above   : 331
% 0.10/0.43  % Current number of archived formulas  : 0
% 0.10/0.43  % Current number of archived clauses   : 2
% 0.10/0.43  % Clause-clause subsumption calls (NU) : 572
% 0.10/0.43  % Rec. Clause-clause subsumption calls : 448
% 0.10/0.43  % Non-unit clause-clause subsumptions  : 18
% 0.10/0.43  % Unit Clause-clause subsumption calls : 21
% 0.10/0.43  % Rewrite failures with RHS unbound    : 0
% 0.10/0.43  % BW rewrite match attempts            : 4
% 0.10/0.43  % BW rewrite match successes           : 0
% 0.10/0.43  % Condensation attempts                : 0
% 0.10/0.43  % Condensation successes               : 0
% 0.10/0.43  % Termbank termtop insertions          : 3894
% 0.10/0.43  % Search garbage collected termcells   : 477
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.011 s
% 0.10/0.43  % System time              : 0.001 s
% 0.10/0.43  % Total time               : 0.012 s
% 0.10/0.43  % Maximum resident set size: 3684 pages
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.013 s
% 0.10/0.43  % System time              : 0.003 s
% 0.10/0.43  % Total time               : 0.016 s
% 0.10/0.43  % Maximum resident set size: 4864 pages
% 0.10/0.43  % E exiting
%------------------------------------------------------------------------------