↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Computer : n013.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:29:44 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X6,X7,X8] :
      ( convergent_lines(X6,X7)
     => ( unorthogonal_lines(X7,X8)
        | unorthogonal_lines(X6,X8) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(ceq3,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( convergent_lines(X1,X3)
        | distinct_lines(X2,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).

fof(ouo1,axiom,
    ! [X9,X6,X7,X8] :
      ( distinct_lines(X6,X7)
     => ( unorthogonal_lines(X7,X8)
        | unorthogonal_lines(X6,X8)
        | apart_point_and_line(X9,X7)
        | apart_point_and_line(X9,X6) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',ouo1) ).

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

fof(ci3,axiom,
    ! [X1,X2] :
      ( convergent_lines(X1,X2)
     => ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).

fof(ci4,axiom,
    ! [X1,X2] :
      ( convergent_lines(X1,X2)
     => ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci4) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X6,X7,X8] :
        ( convergent_lines(X6,X7)
       => ( unorthogonal_lines(X7,X8)
          | unorthogonal_lines(X6,X8) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_7,plain,
    ! [X40,X41,X42] :
      ( convergent_lines(X40,X42)
      | distinct_lines(X41,X42)
      | ~ convergent_lines(X40,X41) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).

fof(c_0_8,negated_conjecture,
    ( ~ unorthogonal_lines(esk2_0,esk3_0)
    & ~ unorthogonal_lines(esk1_0,esk3_0)
    & convergent_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_6])])])]) ).

fof(c_0_9,plain,
    ! [X59,X60,X61,X62] :
      ( unorthogonal_lines(X61,X62)
      | unorthogonal_lines(X60,X62)
      | apart_point_and_line(X59,X61)
      | apart_point_and_line(X59,X60)
      | ~ distinct_lines(X60,X61) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ouo1])])]) ).

cnf(c_0_10,plain,
    ( ~ convergent_lines(X1,X2)
    | convergent_lines(X1,X3)
    | distinct_lines(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

fof(c_0_13,plain,
    ! [X1,X2] :
      ( convergent_lines(X1,X2)
     => ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
    inference(fof_simplification,[status(thm)],[ci3]) ).

cnf(c_0_14,plain,
    ( ~ distinct_lines(X1,X2)
    | unorthogonal_lines(X2,X4)
    | unorthogonal_lines(X1,X4)
    | apart_point_and_line(X3,X2)
    | apart_point_and_line(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    ( distinct_lines(esk2_0,X1)
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

fof(c_0_17,plain,
    ! [X1,X2] :
      ( convergent_lines(X1,X2)
     => ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
    inference(fof_simplification,[status(thm)],[ci4]) ).

fof(c_0_18,plain,
    ! [X26,X27] :
      ( ~ apart_point_and_line(intersection_point(X26,X27),X26)
      | ~ convergent_lines(X26,X27) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).

cnf(c_0_19,negated_conjecture,
    ~ unorthogonal_lines(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_20,negated_conjecture,
    ( convergent_lines(esk1_0,X2)
    | apart_point_and_line(X3,X2)
    | apart_point_and_line(X3,esk2_0)
    | unorthogonal_lines(X2,X1)
    | unorthogonal_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ~ unorthogonal_lines(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_22,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_23,plain,
    ! [X28,X29] :
      ( ~ apart_point_and_line(intersection_point(X28,X29),X29)
      | ~ convergent_lines(X28,X29) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).

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

cnf(c_0_25,negated_conjecture,
    ( apart_point_and_line(X1,esk2_0)
    | apart_point_and_line(X1,esk1_0) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).

cnf(c_0_26,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X2)
    | ~ convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

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

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO215+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n013.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 20 13:28:37 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.43  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.11/0.47  % Version: 3.5.1
% 0.11/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47  % Starting sh5l with 300s (1) cores
% 0.11/0.47  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2826611 completed with status 0
% 0.11/0.47  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47  % No SInE strategy applied
% 0.11/0.47  % Search class: FGHNF-FFMF22-SFFFFFNN
% 0.11/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.47  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.11/0.47  % Starting new_bool_1 with 136s (1) cores
% 0.11/0.47  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2826618 completed with status 0
% 0.11/0.47  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47  % No SInE strategy applied
% 0.11/0.47  % Search class: FGHNF-FFMF22-SFFFFFNN
% 0.11/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.47  % Preprocessing time       : 0.001 s
% 0.11/0.47  % Presaturation interreduction done
% 0.11/0.47  
% 0.11/0.47  % Proof found!
% 0.11/0.47  % SZS status Theorem
% 0.11/0.47  % SZS output start CNFRefutation
% See solution above
% 0.11/0.47  % Parsed axioms                        : 23
% 0.11/0.47  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.47  % Initial clauses                      : 28
% 0.11/0.47  % Removed in clause preprocessing      : 0
% 0.11/0.47  % Initial clauses in saturation        : 28
% 0.11/0.47  % Processed clauses                    : 228
% 0.11/0.47  % ...of these trivial                  : 0
% 0.11/0.47  % ...subsumed                          : 59
% 0.11/0.47  % ...remaining for further processing  : 169
% 0.11/0.47  % Other redundant clauses eliminated   : 0
% 0.11/0.47  % Clauses deleted for lack of memory   : 0
% 0.11/0.47  % Backward-subsumed                    : 0
% 0.11/0.47  % Backward-rewritten                   : 0
% 0.11/0.47  % Generated clauses                    : 691
% 0.11/0.47  % ...of the previous two non-redundant : 550
% 0.11/0.47  % ...aggressively subsumed             : 0
% 0.11/0.47  % Contextual simplify-reflections      : 0
% 0.11/0.47  % Paramodulations                      : 613
% 0.11/0.47  % Factorizations                       : 78
% 0.11/0.47  % NegExts                              : 0
% 0.11/0.47  % Equation resolutions                 : 0
% 0.11/0.47  % Disequality decompositions           : 0
% 0.11/0.47  % Total rewrite steps                  : 138
% 0.11/0.47  % ...of those cached                   : 115
% 0.11/0.47  % Propositional unsat checks           : 0
% 0.11/0.47  %    Propositional check models        : 0
% 0.11/0.47  %    Propositional check unsatisfiable : 0
% 0.11/0.47  %    Propositional clauses             : 0
% 0.11/0.47  %    Propositional clauses after purity: 0
% 0.11/0.47  %    Propositional unsat core size     : 0
% 0.11/0.47  %    Propositional preprocessing time  : 0.000
% 0.11/0.47  %    Propositional encoding time       : 0.000
% 0.11/0.47  %    Propositional solver time         : 0.000
% 0.11/0.47  %    Success case prop preproc time    : 0.000
% 0.11/0.47  %    Success case prop encoding time   : 0.000
% 0.11/0.47  %    Success case prop solver time     : 0.000
% 0.11/0.47  % Current number of processed clauses  : 142
% 0.11/0.47  %    Positive orientable unit clauses  : 24
% 0.11/0.47  %    Positive unorientable unit clauses: 0
% 0.11/0.47  %    Negative unit clauses             : 9
% 0.11/0.47  %    Non-unit-clauses                  : 109
% 0.11/0.47  % Current number of unprocessed clauses: 375
% 0.11/0.47  % ...number of literals in the above   : 1726
% 0.11/0.47  % Current number of archived formulas  : 0
% 0.11/0.47  % Current number of archived clauses   : 27
% 0.11/0.47  % Clause-clause subsumption calls (NU) : 4752
% 0.11/0.47  % Rec. Clause-clause subsumption calls : 2638
% 0.11/0.47  % Non-unit clause-clause subsumptions  : 59
% 0.11/0.47  % Unit Clause-clause subsumption calls : 702
% 0.11/0.47  % Rewrite failures with RHS unbound    : 0
% 0.11/0.47  % BW rewrite match attempts            : 0
% 0.11/0.47  % BW rewrite match successes           : 0
% 0.11/0.47  % Condensation attempts                : 0
% 0.11/0.47  % Condensation successes               : 0
% 0.11/0.47  % Termbank termtop insertions          : 8981
% 0.11/0.47  % Search garbage collected termcells   : 275
% 0.11/0.47  
% 0.11/0.47  % -------------------------------------------------
% 0.11/0.47  % User time                : 0.021 s
% 0.11/0.47  % System time              : 0.003 s
% 0.11/0.47  % Total time               : 0.024 s
% 0.11/0.47  % Maximum resident set size: 3660 pages
% 0.11/0.47  
% 0.11/0.47  % -------------------------------------------------
% 0.11/0.47  % User time                : 0.081 s
% 0.11/0.47  % System time              : 0.014 s
% 0.11/0.47  % Total time               : 0.095 s
% 0.11/0.47  % Maximum resident set size: 4864 pages
% 0.11/0.47  % E exiting
%------------------------------------------------------------------------------