↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO226+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.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:53 PM UTC 2026

% Result   : Theorem 0.17s 0.47s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   27 (  11 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   74 (  31   ~;  20   |;  14   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  25   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X8,X9] :
      ( ( convergent_lines(X8,X9)
        & line(X9)
        & line(X8) )
     => ? [X1] :
          ( point(X1)
         => ( ~ apart_point_and_line(X1,X9)
            & ~ apart_point_and_line(X1,X8) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(apart1,axiom,
    ! [X1] : ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart1) ).

fof(con2,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( ( apart_point_and_line(X3,X2)
          | apart_point_and_line(X3,X1) )
       => distinct_points(X3,intersection_point(X1,X2)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',con2) ).

fof(apart3,axiom,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart3) ).

fof(apart6,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( convergent_lines(X2,X3)
        | convergent_lines(X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart6) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X8,X9] :
        ( ( convergent_lines(X8,X9)
          & line(X9)
          & line(X8) )
       => ? [X1] :
            ( point(X1)
           => ( ~ apart_point_and_line(X1,X9)
              & ~ apart_point_and_line(X1,X8) ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_6,plain,
    ! [X1] : ~ distinct_points(X1,X1),
    inference(fof_simplification,[status(thm)],[apart1]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X8,X9] :
        ( ( convergent_lines(X8,X9)
          & line(X9)
          & line(X8) )
       => ? [X1] :
            ( point(X1)
           => ( ~ apart_point_and_line(X1,X9)
              & ~ apart_point_and_line(X1,X8) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X10] : ~ distinct_points(X10,X10),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).

fof(c_0_9,plain,
    ! [X25,X26,X27] :
      ( ( ~ convergent_lines(X25,X26)
        | distinct_points(X27,intersection_point(X25,X26))
        | ~ apart_point_and_line(X27,X26) )
      & ( ~ convergent_lines(X25,X26)
        | distinct_points(X27,intersection_point(X25,X26))
        | ~ apart_point_and_line(X27,X25) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])])]) ).

fof(c_0_10,plain,
    ! [X1] : ~ convergent_lines(X1,X1),
    inference(fof_simplification,[status(thm)],[apart3]) ).

fof(c_0_11,plain,
    ! [X19,X20,X21] :
      ( convergent_lines(X20,X21)
      | convergent_lines(X19,X21)
      | ~ convergent_lines(X19,X20) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])])]) ).

fof(c_0_12,negated_conjecture,
    ! [X50] :
      ( ( apart_point_and_line(X50,esk2_0)
        | apart_point_and_line(X50,esk1_0) )
      & point(X50)
      & convergent_lines(esk1_0,esk2_0)
      & line(esk2_0)
      & line(esk1_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_13,plain,
    ~ distinct_points(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ( ~ convergent_lines(X3,X2)
    | ~ apart_point_and_line(X1,X2)
    | distinct_points(X1,intersection_point(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,plain,
    ! [X12] : ~ convergent_lines(X12,X12),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).

cnf(c_0_16,plain,
    ( ~ convergent_lines(X1,X2)
    | convergent_lines(X2,X3)
    | convergent_lines(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    ( ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X2)
    | distinct_points(X1,intersection_point(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    ( apart_point_and_line(X1,esk2_0)
    | apart_point_and_line(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_21,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    ( convergent_lines(esk2_0,X1)
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ convergent_lines(X1,esk1_0)
    | apart_point_and_line(intersection_point(X1,esk1_0),esk2_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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

cnf(c_0_26,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO226+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.39  % Computer : n016.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Sun Sep 20 14:02:37 UTC 2026
% 0.10/0.40  % CPUTime  : 
% 0.10/0.40  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.44  Running first-order theorem proving
% 0.10/0.44  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.17/0.47  % Version: 3.5.1
% 0.17/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.17/0.47  % Starting sh5l with 300s (1) cores
% 0.17/0.47  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 241997 completed with status 0
% 0.17/0.47  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.47  % No SInE strategy applied
% 0.17/0.47  % Search class: FGUNF-FFSS22-SFFFFFNN
% 0.17/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.17/0.47  % Starting new_bool_1 with 136s (1) cores
% 0.17/0.47  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 242004 completed with status 0
% 0.17/0.47  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.47  % No SInE strategy applied
% 0.17/0.47  % Search class: FGUNF-FFSS22-SFFFFFNN
% 0.17/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47  % Preprocessing time       : 0.001 s
% 0.17/0.47  % Presaturation interreduction done
% 0.17/0.47  
% 0.17/0.47  % Proof found!
% 0.17/0.47  % SZS status Theorem
% 0.17/0.47  % SZS output start CNFRefutation
% See solution above
% 0.17/0.47  % Parsed axioms                        : 17
% 0.17/0.47  % Removed by relevancy pruning/SinE    : 0
% 0.17/0.47  % Initial clauses                      : 23
% 0.17/0.47  % Removed in clause preprocessing      : 2
% 0.17/0.47  % Initial clauses in saturation        : 21
% 0.17/0.47  % Processed clauses                    : 52
% 0.17/0.47  % ...of these trivial                  : 0
% 0.17/0.47  % ...subsumed                          : 3
% 0.17/0.47  % ...remaining for further processing  : 49
% 0.17/0.47  % Other redundant clauses eliminated   : 0
% 0.17/0.47  % Clauses deleted for lack of memory   : 0
% 0.17/0.47  % Backward-subsumed                    : 0
% 0.17/0.47  % Backward-rewritten                   : 0
% 0.17/0.47  % Generated clauses                    : 26
% 0.17/0.47  % ...of the previous two non-redundant : 25
% 0.17/0.47  % ...aggressively subsumed             : 0
% 0.17/0.47  % Contextual simplify-reflections      : 0
% 0.17/0.47  % Paramodulations                      : 24
% 0.17/0.47  % Factorizations                       : 2
% 0.17/0.47  % NegExts                              : 0
% 0.17/0.47  % Equation resolutions                 : 0
% 0.17/0.47  % Disequality decompositions           : 0
% 0.17/0.47  % Total rewrite steps                  : 1
% 0.17/0.47  % ...of those cached                   : 0
% 0.17/0.47  % Propositional unsat checks           : 0
% 0.17/0.47  %    Propositional check models        : 0
% 0.17/0.47  %    Propositional check unsatisfiable : 0
% 0.17/0.47  %    Propositional clauses             : 0
% 0.17/0.47  %    Propositional clauses after purity: 0
% 0.17/0.47  %    Propositional unsat core size     : 0
% 0.17/0.47  %    Propositional preprocessing time  : 0.000
% 0.17/0.47  %    Propositional encoding time       : 0.000
% 0.17/0.47  %    Propositional solver time         : 0.000
% 0.17/0.47  %    Success case prop preproc time    : 0.000
% 0.17/0.47  %    Success case prop encoding time   : 0.000
% 0.17/0.47  %    Success case prop solver time     : 0.000
% 0.17/0.47  % Current number of processed clauses  : 28
% 0.17/0.47  %    Positive orientable unit clauses  : 4
% 0.17/0.47  %    Positive unorientable unit clauses: 0
% 0.17/0.47  %    Negative unit clauses             : 3
% 0.17/0.47  %    Non-unit-clauses                  : 21
% 0.17/0.47  % Current number of unprocessed clauses: 14
% 0.17/0.47  % ...number of literals in the above   : 51
% 0.17/0.47  % Current number of archived formulas  : 0
% 0.17/0.47  % Current number of archived clauses   : 22
% 0.17/0.47  % Clause-clause subsumption calls (NU) : 37
% 0.17/0.47  % Rec. Clause-clause subsumption calls : 37
% 0.17/0.47  % Non-unit clause-clause subsumptions  : 2
% 0.17/0.47  % Unit Clause-clause subsumption calls : 1
% 0.17/0.47  % Rewrite failures with RHS unbound    : 0
% 0.17/0.47  % BW rewrite match attempts            : 0
% 0.17/0.47  % BW rewrite match successes           : 0
% 0.17/0.47  % Condensation attempts                : 0
% 0.17/0.47  % Condensation successes               : 0
% 0.17/0.47  % Termbank termtop insertions          : 2142
% 0.17/0.47  % Search garbage collected termcells   : 318
% 0.17/0.47  
% 0.17/0.47  % -------------------------------------------------
% 0.17/0.47  % User time                : 0.006 s
% 0.17/0.47  % System time              : 0.002 s
% 0.17/0.47  % Total time               : 0.008 s
% 0.17/0.47  % Maximum resident set size: 3656 pages
% 0.17/0.47  
% 0.17/0.47  % -------------------------------------------------
% 0.17/0.47  % User time                : 0.016 s
% 0.17/0.47  % System time              : 0.013 s
% 0.17/0.47  % Total time               : 0.029 s
% 0.17/0.47  % Maximum resident set size: 4608 pages
% 0.17/0.47  % E exiting
%------------------------------------------------------------------------------