TSTP Solution File: GEO272+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GEO272+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n027.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:32:28 EDT 2023

% Result   : Theorem 2.23s 0.77s
% Output   : CNFRefutation 2.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (  13 unt;   0 def)
%            Number of atoms       :   85 (  25 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  101 (  41   ~;  36   |;  21   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   35 (   0 sgn;  14   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))',axiom,
    ! [X13,X14,X15,X16,X17] :
      ( ( vf(X15,X13) = vf(X15,X14)
        & ron(X14,X17)
        & ron(X13,X16)
        & rcenter(X15,X17)
        & rcenter(X15,X16)
        & ? [X18] :
            ( X14 = X18
            & rpoint(X18) )
        & ? [X19] :
            ( X13 = X19
            & rpoint(X19) ) )
     => X16 = X17 ),
    file('/export/starexec/sandbox/tmp/tmp.D5CbndjjPl/E---3.1_13904.p','qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))') ).

fof('qu(theu(the(212), 1), imp(the(212)))',conjecture,
    ! [X1] :
      ( ( ron(vd1055,X1)
        & rcenter(vd1057,X1)
        & rcircle(X1) )
     => X1 = vd1063 ),
    file('/export/starexec/sandbox/tmp/tmp.D5CbndjjPl/E---3.1_13904.p','qu(theu(the(212), 1), imp(the(212)))') ).

fof('and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))',axiom,
    ( vd1057 = vd1058
    & vd1055 != vd1057
    & rpoint(vd1058)
    & vd1055 = vd1056
    & rpoint(vd1056) ),
    file('/export/starexec/sandbox/tmp/tmp.D5CbndjjPl/E---3.1_13904.p','and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))') ).

fof('and(pred(comma_conjunct2(the(212)), 0), and(pred(comma_conjunct1(the(212)), 0), pred(the(212), 0)))',axiom,
    ( ron(vd1055,vd1063)
    & rcenter(vd1057,vd1063)
    & rcircle(vd1063) ),
    file('/export/starexec/sandbox/tmp/tmp.D5CbndjjPl/E---3.1_13904.p','and(pred(comma_conjunct2(the(212)), 0), and(pred(comma_conjunct1(the(212)), 0), pred(the(212), 0)))') ).

fof(c_0_4,plain,
    ! [X741,X742,X743,X744,X745,X746,X747] :
      ( vf(X743,X741) != vf(X743,X742)
      | ~ ron(X742,X745)
      | ~ ron(X741,X744)
      | ~ rcenter(X743,X745)
      | ~ rcenter(X743,X744)
      | X742 != X746
      | ~ rpoint(X746)
      | X741 != X747
      | ~ rpoint(X747)
      | X744 = X745 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))'])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ( ron(vd1055,X1)
          & rcenter(vd1057,X1)
          & rcircle(X1) )
       => X1 = vd1063 ),
    inference(assume_negation,[status(cth)],['qu(theu(the(212), 1), imp(the(212)))']) ).

cnf(c_0_6,plain,
    ( X5 = X4
    | vf(X1,X2) != vf(X1,X3)
    | ~ ron(X3,X4)
    | ~ ron(X2,X5)
    | ~ rcenter(X1,X4)
    | ~ rcenter(X1,X5)
    | X3 != X6
    | ~ rpoint(X6)
    | X2 != X7
    | ~ rpoint(X7) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_7,negated_conjecture,
    ( ron(vd1055,esk1_0)
    & rcenter(vd1057,esk1_0)
    & rcircle(esk1_0)
    & esk1_0 != vd1063 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_8,plain,
    ( X1 = X2
    | vf(X3,X4) != vf(X3,X5)
    | ~ rpoint(X4)
    | ~ rpoint(X5)
    | ~ rcenter(X3,X2)
    | ~ rcenter(X3,X1)
    | ~ ron(X5,X1)
    | ~ ron(X4,X2) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]) ).

cnf(c_0_9,negated_conjecture,
    rcenter(vd1057,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    vd1057 = vd1058,
    inference(split_conjunct,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))']) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | ~ rpoint(X3)
    | ~ rcenter(X4,X2)
    | ~ rcenter(X4,X1)
    | ~ ron(X3,X1)
    | ~ ron(X3,X2) ),
    inference(er,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    rcenter(vd1058,esk1_0),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    rcenter(vd1057,vd1063),
    inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(212)), 0), and(pred(comma_conjunct1(the(212)), 0), pred(the(212), 0)))']) ).

cnf(c_0_14,negated_conjecture,
    ( X1 = esk1_0
    | ~ rpoint(X2)
    | ~ rcenter(vd1058,X1)
    | ~ ron(X2,esk1_0)
    | ~ ron(X2,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    rcenter(vd1058,vd1063),
    inference(rw,[status(thm)],[c_0_13,c_0_10]) ).

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

cnf(c_0_17,negated_conjecture,
    ron(vd1055,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_18,plain,
    vd1055 = vd1056,
    inference(split_conjunct,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))']) ).

cnf(c_0_19,plain,
    ron(vd1055,vd1063),
    inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(212)), 0), and(pred(comma_conjunct1(the(212)), 0), pred(the(212), 0)))']) ).

cnf(c_0_20,negated_conjecture,
    ( ~ rpoint(X1)
    | ~ ron(X1,esk1_0)
    | ~ ron(X1,vd1063) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ron(vd1056,esk1_0),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    rpoint(vd1056),
    inference(split_conjunct,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))']) ).

cnf(c_0_23,plain,
    ron(vd1056,vd1063),
    inference(rw,[status(thm)],[c_0_19,c_0_18]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13  % Problem    : GEO272+1 : TPTP v8.1.2. Released v4.1.0.
% 0.05/0.14  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Oct  3 07:28:01 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.48  Running first-order theorem proving
% 0.19/0.48  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/tmp/tmp.D5CbndjjPl/E---3.1_13904.p
% 2.23/0.77  # Version: 3.1pre001
% 2.23/0.77  # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.23/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.77  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.23/0.77  # Starting new_bool_3 with 300s (1) cores
% 2.23/0.77  # Starting new_bool_1 with 300s (1) cores
% 2.23/0.77  # Starting sh5l with 300s (1) cores
% 2.23/0.77  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 13983 completed with status 0
% 2.23/0.77  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.23/0.77  # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.23/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.77  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.23/0.77  # No SInE strategy applied
% 2.23/0.77  # Search class: FGHSF-FSLM33-SFFFFFNN
% 2.23/0.77  # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 2.23/0.77  # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 2.23/0.77  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.23/0.77  # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 2.23/0.77  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.23/0.77  # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 2.23/0.77  # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 13994 completed with status 0
% 2.23/0.77  # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 2.23/0.77  # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.23/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.77  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.23/0.77  # No SInE strategy applied
% 2.23/0.77  # Search class: FGHSF-FSLM33-SFFFFFNN
% 2.23/0.77  # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 2.23/0.77  # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 2.23/0.77  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.23/0.77  # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 2.23/0.77  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.23/0.77  # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 2.23/0.77  # Preprocessing time       : 0.017 s
% 2.23/0.77  # Presaturation interreduction done
% 2.23/0.77  
% 2.23/0.77  # Proof found!
% 2.23/0.77  # SZS status Theorem
% 2.23/0.77  # SZS output start CNFRefutation
% See solution above
% 2.23/0.77  # Parsed axioms                        : 108
% 2.23/0.77  # Removed by relevancy pruning/SinE    : 0
% 2.23/0.77  # Initial clauses                      : 265
% 2.23/0.77  # Removed in clause preprocessing      : 2
% 2.23/0.77  # Initial clauses in saturation        : 263
% 2.23/0.77  # Processed clauses                    : 874
% 2.23/0.77  # ...of these trivial                  : 7
% 2.23/0.77  # ...subsumed                          : 28
% 2.23/0.77  # ...remaining for further processing  : 839
% 2.23/0.77  # Other redundant clauses eliminated   : 1088
% 2.23/0.77  # Clauses deleted for lack of memory   : 0
% 2.23/0.77  # Backward-subsumed                    : 3
% 2.23/0.77  # Backward-rewritten                   : 6
% 2.23/0.77  # Generated clauses                    : 1542
% 2.23/0.77  # ...of the previous two non-redundant : 1525
% 2.23/0.77  # ...aggressively subsumed             : 0
% 2.23/0.77  # Contextual simplify-reflections      : 8
% 2.23/0.77  # Paramodulations                      : 1288
% 2.23/0.77  # Factorizations                       : 8
% 2.23/0.77  # NegExts                              : 0
% 2.23/0.77  # Equation resolutions                 : 1102
% 2.23/0.77  # Total rewrite steps                  : 438
% 2.23/0.77  # Propositional unsat checks           : 0
% 2.23/0.77  #    Propositional check models        : 0
% 2.23/0.77  #    Propositional check unsatisfiable : 0
% 2.23/0.77  #    Propositional clauses             : 0
% 2.23/0.77  #    Propositional clauses after purity: 0
% 2.23/0.77  #    Propositional unsat core size     : 0
% 2.23/0.77  #    Propositional preprocessing time  : 0.000
% 2.23/0.77  #    Propositional encoding time       : 0.000
% 2.23/0.77  #    Propositional solver time         : 0.000
% 2.23/0.77  #    Success case prop preproc time    : 0.000
% 2.23/0.77  #    Success case prop encoding time   : 0.000
% 2.23/0.77  #    Success case prop solver time     : 0.000
% 2.23/0.77  # Current number of processed clauses  : 337
% 2.23/0.77  #    Positive orientable unit clauses  : 44
% 2.23/0.77  #    Positive unorientable unit clauses: 0
% 2.23/0.77  #    Negative unit clauses             : 8
% 2.23/0.77  #    Non-unit-clauses                  : 285
% 2.23/0.77  # Current number of unprocessed clauses: 1155
% 2.23/0.77  # ...number of literals in the above   : 16352
% 2.23/0.77  # Current number of archived formulas  : 0
% 2.23/0.77  # Current number of archived clauses   : 270
% 2.23/0.77  # Clause-clause subsumption calls (NU) : 248535
% 2.23/0.77  # Rec. Clause-clause subsumption calls : 7398
% 2.23/0.77  # Non-unit clause-clause subsumptions  : 37
% 2.23/0.77  # Unit Clause-clause subsumption calls : 3402
% 2.23/0.77  # Rewrite failures with RHS unbound    : 0
% 2.23/0.77  # BW rewrite match attempts            : 26
% 2.23/0.77  # BW rewrite match successes           : 8
% 2.23/0.77  # Condensation attempts                : 0
% 2.23/0.77  # Condensation successes               : 0
% 2.23/0.77  # Termbank termtop insertions          : 107948
% 2.23/0.77  
% 2.23/0.77  # -------------------------------------------------
% 2.23/0.77  # User time                : 0.256 s
% 2.23/0.77  # System time              : 0.010 s
% 2.23/0.77  # Total time               : 0.266 s
% 2.23/0.77  # Maximum resident set size: 4184 pages
% 2.23/0.77  
% 2.23/0.77  # -------------------------------------------------
% 2.23/0.77  # User time                : 1.176 s
% 2.23/0.77  # System time              : 0.035 s
% 2.23/0.77  # Total time               : 1.211 s
% 2.23/0.77  # Maximum resident set size: 2508 pages
% 2.23/0.77  % E---3.1 exiting
% 2.23/0.77  % E---3.1 exiting
%------------------------------------------------------------------------------