TSTP Solution File: GEO523+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : GEO523+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 17:35:09 EDT 2023

% Result   : Theorem 0.71s 0.56s
% Output   : CNFRefutation 0.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   40 (  15 unt;   0 def)
%            Number of atoms       :   95 (  59 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   88 (  33   ~;  48   |;   7   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :   94 (   0 sgn;  61   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(aSatz7_6,axiom,
    ! [X13,X12,X16] :
      ( ~ s_m(X13,X12,X16)
      | X16 = s(X12,X13) ),
    file('/export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p',aSatz7_6) ).

fof(aSatz10_4,conjecture,
    ! [X12,X15,X13,X37] :
      ( X12 = X15
      | reflect(X12,X15,X13) != X37
      | reflect(X12,X15,X37) = X13 ),
    file('/export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p',aSatz10_4) ).

fof(aSatz7_18,axiom,
    ! [X12,X13,X15] :
      ( s(X12,X13) != s(X15,X13)
      | X12 = X15 ),
    file('/export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p',aSatz7_18) ).

fof(aSatz7_7,axiom,
    ! [X12,X13] : s(X12,s(X12,X13)) = X13,
    file('/export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p',aSatz7_7) ).

fof(aSatz8_22,axiom,
    ! [X12,X15] : s_m(X12,midpoint(X12,X15),X15),
    file('/export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p',aSatz8_22) ).

fof(aExtPerp4,axiom,
    ! [X12,X15,X13,X16] :
      ( ~ perp(X12,X15,X13,X16)
      | perp(X12,X15,X16,X13) ),
    file('/export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p',aExtPerp4) ).

fof(aSatz10_2a,axiom,
    ! [X12,X15,X13] :
      ( ( X12 = X15
        | s_col(X12,X15,midpoint(X13,reflect(X12,X15,X13))) )
      & ( X12 = X15
        | X13 = reflect(X12,X15,X13)
        | perp(X12,X15,X13,reflect(X12,X15,X13)) ) ),
    file('/export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p',aSatz10_2a) ).

fof(aSatz10_2b,axiom,
    ! [X12,X15,X13,X37] :
      ( ( X12 = X15
        | ~ s_col(X12,X15,midpoint(X13,X37))
        | ~ perp(X12,X15,X13,X37)
        | X37 = reflect(X12,X15,X13) )
      & ( X12 = X15
        | ~ s_col(X12,X15,midpoint(X13,X37))
        | X13 != X37
        | X37 = reflect(X12,X15,X13) ) ),
    file('/export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p',aSatz10_2b) ).

fof(c_0_8,plain,
    ! [X13,X12,X16] :
      ( ~ s_m(X13,X12,X16)
      | X16 = s(X12,X13) ),
    inference(fof_simplification,[status(thm)],[aSatz7_6]) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X12,X15,X13,X37] :
        ( X12 = X15
        | reflect(X12,X15,X13) != X37
        | reflect(X12,X15,X37) = X13 ),
    inference(assume_negation,[status(cth)],[aSatz10_4]) ).

fof(c_0_10,plain,
    ! [X452,X453,X454] :
      ( s(X452,X453) != s(X454,X453)
      | X452 = X454 ),
    inference(variable_rename,[status(thm)],[aSatz7_18]) ).

fof(c_0_11,plain,
    ! [X414,X415] : s(X414,s(X414,X415)) = X415,
    inference(variable_rename,[status(thm)],[aSatz7_7]) ).

fof(c_0_12,plain,
    ! [X411,X412,X413] :
      ( ~ s_m(X411,X412,X413)
      | X413 = s(X412,X411) ),
    inference(variable_rename,[status(thm)],[c_0_8]) ).

fof(c_0_13,plain,
    ! [X605,X606] : s_m(X605,midpoint(X605,X606),X606),
    inference(variable_rename,[status(thm)],[aSatz8_22]) ).

fof(c_0_14,plain,
    ! [X12,X15,X13,X16] :
      ( ~ perp(X12,X15,X13,X16)
      | perp(X12,X15,X16,X13) ),
    inference(fof_simplification,[status(thm)],[aExtPerp4]) ).

fof(c_0_15,plain,
    ! [X805,X806,X807] :
      ( ( X805 = X806
        | s_col(X805,X806,midpoint(X807,reflect(X805,X806,X807))) )
      & ( X805 = X806
        | X807 = reflect(X805,X806,X807)
        | perp(X805,X806,X807,reflect(X805,X806,X807)) ) ),
    inference(variable_rename,[status(thm)],[aSatz10_2a]) ).

fof(c_0_16,negated_conjecture,
    ( esk1_0 != esk2_0
    & reflect(esk1_0,esk2_0,esk3_0) = esk4_0
    & reflect(esk1_0,esk2_0,esk4_0) != esk3_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

cnf(c_0_17,plain,
    ( X1 = X3
    | s(X1,X2) != s(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_18,plain,
    s(X1,s(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,plain,
    ( X3 = s(X2,X1)
    | ~ s_m(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    s_m(X1,midpoint(X1,X2),X2),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_21,plain,
    ! [X12,X15,X13,X37] :
      ( ( X12 = X15
        | ~ s_col(X12,X15,midpoint(X13,X37))
        | ~ perp(X12,X15,X13,X37)
        | X37 = reflect(X12,X15,X13) )
      & ( X12 = X15
        | ~ s_col(X12,X15,midpoint(X13,X37))
        | X13 != X37
        | X37 = reflect(X12,X15,X13) ) ),
    inference(fof_simplification,[status(thm)],[aSatz10_2b]) ).

fof(c_0_22,plain,
    ! [X648,X649,X650,X651] :
      ( ~ perp(X648,X649,X650,X651)
      | perp(X648,X649,X651,X650) ),
    inference(variable_rename,[status(thm)],[c_0_14]) ).

cnf(c_0_23,plain,
    ( X1 = X2
    | X3 = reflect(X1,X2,X3)
    | perp(X1,X2,X3,reflect(X1,X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    reflect(esk1_0,esk2_0,esk3_0) = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_25,negated_conjecture,
    esk1_0 != esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_26,plain,
    ( X1 = X2
    | s(X1,s(X2,X3)) != X3 ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_27,plain,
    s(midpoint(X1,X2),X1) = X2,
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

fof(c_0_28,plain,
    ! [X808,X809,X810,X811] :
      ( ( X808 = X809
        | ~ s_col(X808,X809,midpoint(X810,X811))
        | ~ perp(X808,X809,X810,X811)
        | X811 = reflect(X808,X809,X810) )
      & ( X808 = X809
        | ~ s_col(X808,X809,midpoint(X810,X811))
        | X810 != X811
        | X811 = reflect(X808,X809,X810) ) ),
    inference(variable_rename,[status(thm)],[c_0_21]) ).

cnf(c_0_29,plain,
    ( perp(X1,X2,X4,X3)
    | ~ perp(X1,X2,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_30,negated_conjecture,
    ( esk4_0 = esk3_0
    | perp(esk1_0,esk2_0,esk3_0,esk4_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).

cnf(c_0_31,plain,
    midpoint(s(X1,X2),X2) = X1,
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]) ).

cnf(c_0_32,plain,
    ( X1 = X2
    | s_col(X1,X2,midpoint(X3,reflect(X1,X2,X3))) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_33,plain,
    ( X1 = X2
    | X4 = reflect(X1,X2,X3)
    | ~ s_col(X1,X2,midpoint(X3,X4))
    | ~ perp(X1,X2,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,negated_conjecture,
    ( esk4_0 = esk3_0
    | perp(esk1_0,esk2_0,esk4_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    reflect(esk1_0,esk2_0,esk4_0) != esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_36,plain,
    midpoint(X1,X2) = midpoint(X2,X1),
    inference(spm,[status(thm)],[c_0_31,c_0_27]) ).

cnf(c_0_37,negated_conjecture,
    s_col(esk1_0,esk2_0,midpoint(esk3_0,esk4_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_25]) ).

cnf(c_0_38,negated_conjecture,
    esk4_0 = esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_25]),c_0_36]),c_0_37])]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_38]),c_0_24]),c_0_38])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GEO523+1 : TPTP v8.1.2. Released v7.0.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 2400
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Oct  3 06:33:44 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.s3wieFnfmd/E---3.1_7838.p
% 0.71/0.56  # Version: 3.1pre001
% 0.71/0.56  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.71/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.56  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.71/0.56  # Starting new_bool_3 with 300s (1) cores
% 0.71/0.56  # Starting new_bool_1 with 300s (1) cores
% 0.71/0.56  # Starting sh5l with 300s (1) cores
% 0.71/0.56  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7974 completed with status 0
% 0.71/0.56  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.71/0.56  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.71/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.56  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.71/0.56  # No SInE strategy applied
% 0.71/0.56  # Search class: FGHSM-FSLF33-MFFFFFNN
% 0.71/0.56  # partial match(1): FGHSM-FSLM33-MFFFFFNN
% 0.71/0.56  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.71/0.56  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 405s (1) cores
% 0.71/0.56  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.71/0.56  # Starting G-E--_303_C18_F1_URBAN_S0Y with 330s (1) cores
% 0.71/0.56  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.71/0.56  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.71/0.56  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 7995 completed with status 0
% 0.71/0.56  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.71/0.56  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.71/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.56  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.71/0.56  # No SInE strategy applied
% 0.71/0.56  # Search class: FGHSM-FSLF33-MFFFFFNN
% 0.71/0.56  # partial match(1): FGHSM-FSLM33-MFFFFFNN
% 0.71/0.56  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.71/0.56  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 405s (1) cores
% 0.71/0.56  # Preprocessing time       : 0.005 s
% 0.71/0.56  # Presaturation interreduction done
% 0.71/0.56  
% 0.71/0.56  # Proof found!
% 0.71/0.56  # SZS status Theorem
% 0.71/0.56  # SZS output start CNFRefutation
% See solution above
% 0.71/0.56  # Parsed axioms                        : 201
% 0.71/0.56  # Removed by relevancy pruning/SinE    : 0
% 0.71/0.56  # Initial clauses                      : 294
% 0.71/0.56  # Removed in clause preprocessing      : 1
% 0.71/0.56  # Initial clauses in saturation        : 293
% 0.71/0.56  # Processed clauses                    : 668
% 0.71/0.56  # ...of these trivial                  : 25
% 0.71/0.56  # ...subsumed                          : 86
% 0.71/0.56  # ...remaining for further processing  : 557
% 0.71/0.56  # Other redundant clauses eliminated   : 38
% 0.71/0.56  # Clauses deleted for lack of memory   : 0
% 0.71/0.56  # Backward-subsumed                    : 1
% 0.71/0.56  # Backward-rewritten                   : 28
% 0.71/0.56  # Generated clauses                    : 815
% 0.71/0.56  # ...of the previous two non-redundant : 579
% 0.71/0.56  # ...aggressively subsumed             : 0
% 0.71/0.56  # Contextual simplify-reflections      : 3
% 0.71/0.56  # Paramodulations                      : 772
% 0.71/0.56  # Factorizations                       : 2
% 0.71/0.56  # NegExts                              : 0
% 0.71/0.56  # Equation resolutions                 : 41
% 0.71/0.56  # Total rewrite steps                  : 333
% 0.71/0.56  # Propositional unsat checks           : 0
% 0.71/0.56  #    Propositional check models        : 0
% 0.71/0.56  #    Propositional check unsatisfiable : 0
% 0.71/0.56  #    Propositional clauses             : 0
% 0.71/0.56  #    Propositional clauses after purity: 0
% 0.71/0.56  #    Propositional unsat core size     : 0
% 0.71/0.56  #    Propositional preprocessing time  : 0.000
% 0.71/0.56  #    Propositional encoding time       : 0.000
% 0.71/0.56  #    Propositional solver time         : 0.000
% 0.71/0.56  #    Success case prop preproc time    : 0.000
% 0.71/0.56  #    Success case prop encoding time   : 0.000
% 0.71/0.56  #    Success case prop solver time     : 0.000
% 0.71/0.56  # Current number of processed clauses  : 244
% 0.71/0.56  #    Positive orientable unit clauses  : 36
% 0.71/0.56  #    Positive unorientable unit clauses: 1
% 0.71/0.56  #    Negative unit clauses             : 18
% 0.71/0.56  #    Non-unit-clauses                  : 189
% 0.71/0.56  # Current number of unprocessed clauses: 455
% 0.71/0.56  # ...number of literals in the above   : 1260
% 0.71/0.56  # Current number of archived formulas  : 0
% 0.71/0.56  # Current number of archived clauses   : 297
% 0.71/0.56  # Clause-clause subsumption calls (NU) : 30884
% 0.71/0.56  # Rec. Clause-clause subsumption calls : 13021
% 0.71/0.56  # Non-unit clause-clause subsumptions  : 67
% 0.71/0.56  # Unit Clause-clause subsumption calls : 161
% 0.71/0.56  # Rewrite failures with RHS unbound    : 0
% 0.71/0.56  # BW rewrite match attempts            : 137
% 0.71/0.56  # BW rewrite match successes           : 16
% 0.71/0.56  # Condensation attempts                : 0
% 0.71/0.56  # Condensation successes               : 0
% 0.71/0.56  # Termbank termtop insertions          : 29057
% 0.71/0.56  
% 0.71/0.56  # -------------------------------------------------
% 0.71/0.56  # User time                : 0.064 s
% 0.71/0.56  # System time              : 0.005 s
% 0.71/0.56  # Total time               : 0.069 s
% 0.71/0.56  # Maximum resident set size: 3424 pages
% 0.71/0.56  
% 0.71/0.56  # -------------------------------------------------
% 0.71/0.56  # User time                : 0.250 s
% 0.71/0.56  # System time              : 0.023 s
% 0.71/0.56  # Total time               : 0.272 s
% 0.71/0.56  # Maximum resident set size: 2064 pages
% 0.71/0.56  % E---3.1 exiting
%------------------------------------------------------------------------------