TSTP Solution File: GEO148+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : GEO148+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 19:57:59 EDT 2024

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   43 (  18   ~;  11   |;   8   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t14,conjecture,
    ! [X3,X12,X13] :
      ( connect(X12,X13,X3)
     => ! [X18,X19] :
          ( ( ordered_by(trajectory_of(X13),X19,X3)
            & ordered_by(trajectory_of(X12),X3,X18) )
         => ~ once(at_the_same_time(at(X12,X18),at(X13,X19))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14) ).

fof(homogeneous_behaviour,axiom,
    ! [X16,X17,X18,X19,X12,X13] :
      ( ( once(at_the_same_time(at(X12,X16),at(X13,X17)))
        & once(at_the_same_time(at(X12,X18),at(X13,X19))) )
     => ~ ( ordered_by(trajectory_of(X12),X16,X18)
          & ordered_by(trajectory_of(X13),X19,X17) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+3.ax',homogeneous_behaviour) ).

fof(connect_defn,axiom,
    ! [X12,X13,X3] :
      ( connect(X12,X13,X3)
    <=> once(at_the_same_time(at(X12,X3),at(X13,X3))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+3.ax',connect_defn) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X3,X12,X13] :
        ( connect(X12,X13,X3)
       => ! [X18,X19] :
            ( ( ordered_by(trajectory_of(X13),X19,X3)
              & ordered_by(trajectory_of(X12),X3,X18) )
           => ~ once(at_the_same_time(at(X12,X18),at(X13,X19))) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t14])]) ).

fof(c_0_4,plain,
    ! [X35,X36,X37,X38,X39,X40] :
      ( ~ once(at_the_same_time(at(X39,X35),at(X40,X36)))
      | ~ once(at_the_same_time(at(X39,X37),at(X40,X38)))
      | ~ ordered_by(trajectory_of(X39),X35,X37)
      | ~ ordered_by(trajectory_of(X40),X38,X36) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[homogeneous_behaviour])])]) ).

fof(c_0_5,negated_conjecture,
    ( connect(esk2_0,esk3_0,esk1_0)
    & ordered_by(trajectory_of(esk3_0),esk5_0,esk1_0)
    & ordered_by(trajectory_of(esk2_0),esk1_0,esk4_0)
    & once(at_the_same_time(at(esk2_0,esk4_0),at(esk3_0,esk5_0))) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_6,plain,
    ! [X53,X54,X55] :
      ( ( ~ connect(X53,X54,X55)
        | once(at_the_same_time(at(X53,X55),at(X54,X55))) )
      & ( ~ once(at_the_same_time(at(X53,X55),at(X54,X55)))
        | connect(X53,X54,X55) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connect_defn])])]) ).

cnf(c_0_7,plain,
    ( ~ once(at_the_same_time(at(X1,X2),at(X3,X4)))
    | ~ once(at_the_same_time(at(X1,X5),at(X3,X6)))
    | ~ ordered_by(trajectory_of(X1),X2,X5)
    | ~ ordered_by(trajectory_of(X3),X6,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    once(at_the_same_time(at(esk2_0,esk4_0),at(esk3_0,esk5_0))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( once(at_the_same_time(at(X1,X3),at(X2,X3)))
    | ~ connect(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    connect(esk2_0,esk3_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ once(at_the_same_time(at(esk2_0,X1),at(esk3_0,X2)))
    | ~ ordered_by(trajectory_of(esk3_0),esk5_0,X2)
    | ~ ordered_by(trajectory_of(esk2_0),X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    once(at_the_same_time(at(esk2_0,esk1_0),at(esk3_0,esk1_0))),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ordered_by(trajectory_of(esk3_0),esk5_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,negated_conjecture,
    ordered_by(trajectory_of(esk2_0),esk1_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : GEO148+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n028.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun May 19 15:01:08 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.49  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.20/0.50  # Version: 3.1.0
% 0.20/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # new_bool_3 with pid 28389 completed with status 0
% 0.20/0.50  # Result found by new_bool_3
% 0.20/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FGHSF-FFMS21-MFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.20/0.50  # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 28392 completed with status 0
% 0.20/0.50  # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.20/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FGHSF-FFMS21-MFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Theorem
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 37
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 25
% 0.20/0.50  # Initial clauses                      : 22
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 22
% 0.20/0.50  # Processed clauses                    : 37
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 4
% 0.20/0.50  # ...remaining for further processing  : 33
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 0
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 62
% 0.20/0.50  # ...of the previous two non-redundant : 46
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 60
% 0.20/0.50  # Factorizations                       : 2
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 10
% 0.20/0.50  # ...of those cached                   : 2
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 33
% 0.20/0.50  #    Positive orientable unit clauses  : 12
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 0
% 0.20/0.50  #    Non-unit-clauses                  : 21
% 0.20/0.50  # Current number of unprocessed clauses: 26
% 0.20/0.50  # ...number of literals in the above   : 50
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 0
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 83
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 50
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 4
% 0.20/0.50  # Unit Clause-clause subsumption calls : 12
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 14
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 2828
% 0.20/0.50  # Search garbage collected termcells   : 564
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.003 s
% 0.20/0.50  # System time              : 0.004 s
% 0.20/0.50  # Total time               : 0.007 s
% 0.20/0.50  # Maximum resident set size: 1852 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.004 s
% 0.20/0.50  # System time              : 0.007 s
% 0.20/0.50  # Total time               : 0.011 s
% 0.20/0.50  # Maximum resident set size: 1768 pages
% 0.20/0.50  % E---3.1 exiting
% 0.20/0.50  % E exiting
%------------------------------------------------------------------------------