↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO208+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 : 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:27:46 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X1,X2,X3] :
      ( ( ~ convergent_lines(X2,X3)
        & ~ apart_point_and_line(X1,X3)
        & ~ apart_point_and_line(X1,X2) )
     => ~ distinct_lines(X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

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

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( ~ convergent_lines(X2,X3)
          & ~ apart_point_and_line(X1,X3)
          & ~ apart_point_and_line(X1,X2) )
       => ~ distinct_lines(X2,X3) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( ~ convergent_lines(X2,X3)
          & ~ apart_point_and_line(X1,X3)
          & ~ apart_point_and_line(X1,X2) )
       => ~ distinct_lines(X2,X3) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_4,plain,
    ! [X22,X23,X24] :
      ( convergent_lines(X23,X24)
      | apart_point_and_line(X22,X24)
      | apart_point_and_line(X22,X23)
      | ~ distinct_lines(X23,X24) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cup1])])]) ).

fof(c_0_5,negated_conjecture,
    ( distinct_lines(esk2_0,esk3_0)
    & ~ convergent_lines(esk2_0,esk3_0)
    & ~ apart_point_and_line(esk1_0,esk3_0)
    & ~ apart_point_and_line(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_3])])])]) ).

cnf(c_0_6,plain,
    ( ~ distinct_lines(X1,X2)
    | convergent_lines(X1,X2)
    | apart_point_and_line(X3,X2)
    | apart_point_and_line(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    distinct_lines(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_9,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    ( apart_point_and_line(X1,esk2_0)
    | apart_point_and_line(X1,esk3_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO208+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.11/0.36  % Computer : n013.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 20 13:24:20 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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.43  % Version: 3.5.1
% 0.11/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43  % Starting sh5l with 300s (1) cores
% 0.11/0.43  % new_bool_1 with pid 2815619 completed with status 0
% 0.11/0.43  % Result found by new_bool_1
% 0.11/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43  % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.11/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43  % SubtermCWHack with pid 2815622 completed with status 0
% 0.11/0.43  % Result found by SubtermCWHack
% 0.11/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43  % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.11/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43  % Preprocessing time       : 0.001 s
% 0.11/0.43  
% 0.11/0.43  % Proof found!
% 0.11/0.43  % SZS status Theorem
% 0.11/0.43  % SZS output start CNFRefutation
% See solution above
% 0.11/0.43  % Parsed axioms                        : 16
% 0.11/0.43  % Removed by relevancy pruning/SinE    : 4
% 0.11/0.43  % Initial clauses                      : 15
% 0.11/0.43  % Removed in clause preprocessing      : 0
% 0.11/0.43  % Initial clauses in saturation        : 15
% 0.11/0.43  % Processed clauses                    : 25
% 0.11/0.43  % ...of these trivial                  : 0
% 0.11/0.43  % ...subsumed                          : 4
% 0.11/0.43  % ...remaining for further processing  : 21
% 0.11/0.43  % Other redundant clauses eliminated   : 0
% 0.11/0.43  % Clauses deleted for lack of memory   : 0
% 0.11/0.43  % Backward-subsumed                    : 0
% 0.11/0.43  % Backward-rewritten                   : 0
% 0.11/0.43  % Generated clauses                    : 43
% 0.11/0.43  % ...of the previous two non-redundant : 30
% 0.11/0.43  % ...aggressively subsumed             : 0
% 0.11/0.43  % Contextual simplify-reflections      : 0
% 0.11/0.43  % Paramodulations                      : 35
% 0.11/0.43  % Factorizations                       : 8
% 0.11/0.43  % NegExts                              : 0
% 0.11/0.43  % Equation resolutions                 : 0
% 0.11/0.43  % Disequality decompositions           : 0
% 0.11/0.43  % Total rewrite steps                  : 10
% 0.11/0.43  % ...of those cached                   : 8
% 0.11/0.43  % Propositional unsat checks           : 0
% 0.11/0.43  %    Propositional check models        : 0
% 0.11/0.43  %    Propositional check unsatisfiable : 0
% 0.11/0.43  %    Propositional clauses             : 0
% 0.11/0.43  %    Propositional clauses after purity: 0
% 0.11/0.43  %    Propositional unsat core size     : 0
% 0.11/0.43  %    Propositional preprocessing time  : 0.000
% 0.11/0.43  %    Propositional encoding time       : 0.000
% 0.11/0.43  %    Propositional solver time         : 0.000
% 0.11/0.43  %    Success case prop preproc time    : 0.000
% 0.11/0.43  %    Success case prop encoding time   : 0.000
% 0.11/0.43  %    Success case prop solver time     : 0.000
% 0.11/0.43  % Current number of processed clauses  : 21
% 0.11/0.43  %    Positive orientable unit clauses  : 2
% 0.11/0.43  %    Positive unorientable unit clauses: 0
% 0.11/0.43  %    Negative unit clauses             : 6
% 0.11/0.43  %    Non-unit-clauses                  : 13
% 0.11/0.43  % Current number of unprocessed clauses: 20
% 0.11/0.43  % ...number of literals in the above   : 85
% 0.11/0.43  % Current number of archived formulas  : 0
% 0.11/0.43  % Current number of archived clauses   : 0
% 0.11/0.43  % Clause-clause subsumption calls (NU) : 29
% 0.11/0.43  % Rec. Clause-clause subsumption calls : 23
% 0.11/0.43  % Non-unit clause-clause subsumptions  : 4
% 0.11/0.43  % Unit Clause-clause subsumption calls : 2
% 0.11/0.43  % Rewrite failures with RHS unbound    : 0
% 0.11/0.43  % BW rewrite match attempts            : 0
% 0.11/0.43  % BW rewrite match successes           : 0
% 0.11/0.43  % Condensation attempts                : 0
% 0.11/0.43  % Condensation successes               : 0
% 0.11/0.43  % Termbank termtop insertions          : 1478
% 0.11/0.43  % Search garbage collected termcells   : 198
% 0.11/0.43  
% 0.11/0.43  % -------------------------------------------------
% 0.11/0.43  % User time                : 0.004 s
% 0.11/0.43  % System time              : 0.001 s
% 0.11/0.43  % Total time               : 0.006 s
% 0.11/0.43  % Maximum resident set size: 3652 pages
% 0.11/0.43  
% 0.11/0.43  % -------------------------------------------------
% 0.11/0.43  % User time                : 0.007 s
% 0.11/0.43  % System time              : 0.004 s
% 0.11/0.43  % Total time               : 0.012 s
% 0.11/0.43  % Maximum resident set size: 4608 pages
% 0.11/0.43  % E exiting
%------------------------------------------------------------------------------