↑ 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  : GEO268+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 : n006.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:58 PM UTC 2026

% Result   : Theorem 0.16s 1.07s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   5 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   52 (  22   ~;  22   |;   4   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   32 (   2 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X4,X5] :
      ( unequally_directed_lines(X4,X5)
    <=> unequally_directed_opposite_lines(X4,reverse_line(X5)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

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(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(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(c_0_5,negated_conjecture,
    ~ ! [X4,X5] :
        ( unequally_directed_lines(X4,X5)
      <=> unequally_directed_opposite_lines(X4,reverse_line(X5)) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_6,negated_conjecture,
    ( ( unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))
      | unequally_directed_lines(esk1_0,esk2_0) )
    & ( ~ unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))
      | ~ unequally_directed_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_5])])])]) ).

fof(c_0_7,plain,
    ! [X9,X10] :
      ( ( unequally_directed_opposite_lines(X9,X10)
        | ~ unequally_directed_lines(X9,reverse_line(X10)) )
      & ( unequally_directed_lines(X9,reverse_line(X10))
        | ~ unequally_directed_opposite_lines(X9,X10) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])])]) ).

fof(c_0_8,plain,
    ! [X50,X51] :
      ( left_convergent_lines(X50,reverse_line(X51))
      | left_convergent_lines(X50,X51)
      | ~ unequally_directed_lines(X50,reverse_line(X51))
      | ~ unequally_directed_lines(X50,X51) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_basics])])]) ).

fof(c_0_9,plain,
    ! [X54,X55] :
      ( ~ left_convergent_lines(X54,reverse_line(X55))
      & ~ left_convergent_lines(X54,X55) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11_basics])])]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))
    | ~ unequally_directed_lines(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

fof(c_0_12,plain,
    ! [X48,X49] :
      ( unequally_directed_lines(X48,reverse_line(X49))
      | unequally_directed_lines(X48,X49) ),
    inference(variable_rename,[status(thm)],[ax8_basics]) ).

cnf(c_0_13,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_8]) ).

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

cnf(c_0_15,negated_conjecture,
    ( ~ unequally_directed_lines(esk1_0,esk2_0)
    | ~ unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk2_0))) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

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

cnf(c_0_18,negated_conjecture,
    ( unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))
    | unequally_directed_lines(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_19,plain,
    ( ~ unequally_directed_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).

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

cnf(c_0_22,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk2_0))),
    inference(sr,[status(thm)],[c_0_21,c_0_22]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO268+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.11/0.99  % Computer : n006.cluster.edu
% 0.11/0.99  % Model    : x86_64 x86_64
% 0.11/0.99  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.99  % Memory   : 8046.5625MB
% 0.11/0.99  % OS       : Linux 6.8.0-71-generic
% 0.11/0.99  % CPULimit : 300
% 0.11/0.99  % WCLimit  : 300
% 0.11/0.99  % DateTime : Sun Sep 20 14:58:15 UTC 2026
% 0.11/0.99  % CPUTime  : 
% 0.11/0.99  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/1.04  Running first-order theorem proving
% 0.16/1.04  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.16/1.07  % Version: 3.5.1
% 0.16/1.07  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/1.07  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/1.07  % Starting new_bool_3 with 300s (1) cores
% 0.16/1.07  % Starting new_bool_1 with 300s (1) cores
% 0.16/1.07  % Starting sh5l with 300s (1) cores
% 0.16/1.07  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 782263 completed with status 0
% 0.16/1.07  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/1.07  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/1.07  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/1.07  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/1.07  % No SInE strategy applied
% 0.16/1.07  % Search class: FGHNS-FFMF21-SFFFFFNN
% 0.16/1.07  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/1.07  % Starting SubtermCWHack with 136s (1) cores
% 0.16/1.07  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/1.07  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/1.07  % Starting new_bool_3 with 136s (1) cores
% 0.16/1.07  % Starting new_bool_1 with 136s (1) cores
% 0.16/1.07  % SubtermCWHack with pid 782269 completed with status 0
% 0.16/1.07  % Result found by SubtermCWHack
% 0.16/1.07  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/1.07  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/1.07  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/1.07  % No SInE strategy applied
% 0.16/1.07  % Search class: FGHNS-FFMF21-SFFFFFNN
% 0.16/1.07  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/1.07  % Starting SubtermCWHack with 136s (1) cores
% 0.16/1.07  % Preprocessing time       : 0.001 s
% 0.16/1.07  
% 0.16/1.07  % Proof found!
% 0.16/1.07  % SZS status Theorem
% 0.16/1.07  % SZS output start CNFRefutation
% See solution above
% 0.16/1.07  % Parsed axioms                        : 37
% 0.16/1.07  % Removed by relevancy pruning/SinE    : 0
% 0.16/1.07  % Initial clauses                      : 68
% 0.16/1.07  % Removed in clause preprocessing      : 0
% 0.16/1.07  % Initial clauses in saturation        : 68
% 0.16/1.07  % Processed clauses                    : 116
% 0.16/1.07  % ...of these trivial                  : 0
% 0.16/1.07  % ...subsumed                          : 31
% 0.16/1.07  % ...remaining for further processing  : 85
% 0.16/1.07  % Other redundant clauses eliminated   : 0
% 0.16/1.07  % Clauses deleted for lack of memory   : 0
% 0.16/1.07  % Backward-subsumed                    : 9
% 0.16/1.07  % Backward-rewritten                   : 0
% 0.16/1.07  % Generated clauses                    : 243
% 0.16/1.07  % ...of the previous two non-redundant : 203
% 0.16/1.07  % ...aggressively subsumed             : 0
% 0.16/1.07  % Contextual simplify-reflections      : 2
% 0.16/1.07  % Paramodulations                      : 231
% 0.16/1.07  % Factorizations                       : 10
% 0.16/1.07  % NegExts                              : 0
% 0.16/1.07  % Equation resolutions                 : 0
% 0.16/1.07  % Disequality decompositions           : 0
% 0.16/1.07  % Total rewrite steps                  : 33
% 0.16/1.07  % ...of those cached                   : 16
% 0.16/1.07  % Propositional unsat checks           : 0
% 0.16/1.07  %    Propositional check models        : 0
% 0.16/1.07  %    Propositional check unsatisfiable : 0
% 0.16/1.07  %    Propositional clauses             : 0
% 0.16/1.07  %    Propositional clauses after purity: 0
% 0.16/1.07  %    Propositional unsat core size     : 0
% 0.16/1.07  %    Propositional preprocessing time  : 0.000
% 0.16/1.07  %    Propositional encoding time       : 0.000
% 0.16/1.07  %    Propositional solver time         : 0.000
% 0.16/1.07  %    Success case prop preproc time    : 0.000
% 0.16/1.07  %    Success case prop encoding time   : 0.000
% 0.16/1.07  %    Success case prop solver time     : 0.000
% 0.16/1.07  % Current number of processed clauses  : 74
% 0.16/1.07  %    Positive orientable unit clauses  : 15
% 0.16/1.07  %    Positive unorientable unit clauses: 0
% 0.16/1.07  %    Negative unit clauses             : 17
% 0.16/1.07  %    Non-unit-clauses                  : 42
% 0.16/1.07  % Current number of unprocessed clauses: 153
% 0.16/1.07  % ...number of literals in the above   : 471
% 0.16/1.07  % Current number of archived formulas  : 0
% 0.16/1.07  % Current number of archived clauses   : 11
% 0.16/1.07  % Clause-clause subsumption calls (NU) : 639
% 0.16/1.07  % Rec. Clause-clause subsumption calls : 540
% 0.16/1.07  % Non-unit clause-clause subsumptions  : 18
% 0.16/1.07  % Unit Clause-clause subsumption calls : 160
% 0.16/1.07  % Rewrite failures with RHS unbound    : 0
% 0.16/1.07  % BW rewrite match attempts            : 5
% 0.16/1.07  % BW rewrite match successes           : 0
% 0.16/1.07  % Condensation attempts                : 0
% 0.16/1.07  % Condensation successes               : 0
% 0.16/1.07  % Termbank termtop insertions          : 6639
% 0.16/1.07  % Search garbage collected termcells   : 736
% 0.16/1.07  
% 0.16/1.07  % -------------------------------------------------
% 0.16/1.07  % User time                : 0.010 s
% 0.16/1.07  % System time              : 0.004 s
% 0.16/1.07  % Total time               : 0.013 s
% 0.16/1.07  % Maximum resident set size: 3644 pages
% 0.16/1.07  
% 0.16/1.07  % -------------------------------------------------
% 0.16/1.07  % User time                : 0.030 s
% 0.16/1.07  % System time              : 0.013 s
% 0.16/1.07  % Total time               : 0.042 s
% 0.16/1.07  % Maximum resident set size: 4608 pages
% 0.16/1.07  % E exiting
%------------------------------------------------------------------------------