TSTP Solution File: GEO083-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : GEO083-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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:33:42 EDT 2023

% Result   : Unsatisfiable 0.19s 0.55s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  10 unt;   5 nHn;  22 RR)
%            Number of literals    :   53 (   6 equ;  27 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   48 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(corollary_2_6_1_70,negated_conjecture,
    ~ part_of(sum(sk14,sk15),sum(sk14,sk16)),
    file('/export/starexec/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p',corollary_2_6_1_70) ).

cnf(part_of_defn_3,axiom,
    ( part_of(X1,X2)
    | ~ incident_c(ax0_sk1(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p',part_of_defn_3) ).

cnf(sum_defn_5,axiom,
    ( incident_c(X4,X1)
    | X1 != sum(X2,X3)
    | ~ incident_c(X4,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p',sum_defn_5) ).

cnf(sum_defn_4,axiom,
    ( incident_c(X4,X2)
    | incident_c(X4,X3)
    | X1 != sum(X2,X3)
    | ~ incident_c(X4,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p',sum_defn_4) ).

cnf(part_of_defn_2,axiom,
    ( incident_c(ax0_sk1(X1,X2),X1)
    | part_of(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p',part_of_defn_2) ).

cnf(sum_defn_6,axiom,
    ( incident_c(X4,X1)
    | X1 != sum(X2,X3)
    | ~ incident_c(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p',sum_defn_6) ).

cnf(part_of_defn_1,axiom,
    ( incident_c(X3,X2)
    | ~ part_of(X1,X2)
    | ~ incident_c(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p',part_of_defn_1) ).

cnf(corollary_2_6_1_67,negated_conjecture,
    part_of(sk15,sk16),
    file('/export/starexec/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p',corollary_2_6_1_67) ).

cnf(c_0_8,negated_conjecture,
    ~ part_of(sum(sk14,sk15),sum(sk14,sk16)),
    corollary_2_6_1_70 ).

cnf(c_0_9,axiom,
    ( part_of(X1,X2)
    | ~ incident_c(ax0_sk1(X1,X2),X2) ),
    part_of_defn_3 ).

cnf(c_0_10,axiom,
    ( incident_c(X4,X1)
    | X1 != sum(X2,X3)
    | ~ incident_c(X4,X2) ),
    sum_defn_5 ).

cnf(c_0_11,axiom,
    ( incident_c(X4,X2)
    | incident_c(X4,X3)
    | X1 != sum(X2,X3)
    | ~ incident_c(X4,X1) ),
    sum_defn_4 ).

cnf(c_0_12,axiom,
    ( incident_c(ax0_sk1(X1,X2),X1)
    | part_of(X1,X2) ),
    part_of_defn_2 ).

cnf(c_0_13,negated_conjecture,
    ~ incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sum(sk14,sk16)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    ( incident_c(X1,sum(X2,X3))
    | ~ incident_c(X1,X2) ),
    inference(er,[status(thm)],[c_0_10]) ).

cnf(c_0_15,axiom,
    ( incident_c(X4,X1)
    | X1 != sum(X2,X3)
    | ~ incident_c(X4,X3) ),
    sum_defn_6 ).

cnf(c_0_16,axiom,
    ( incident_c(X3,X2)
    | ~ part_of(X1,X2)
    | ~ incident_c(X3,X1) ),
    part_of_defn_1 ).

cnf(c_0_17,negated_conjecture,
    part_of(sk15,sk16),
    corollary_2_6_1_67 ).

cnf(c_0_18,plain,
    ( incident_c(X1,X2)
    | incident_c(X1,X3)
    | ~ incident_c(X1,sum(X3,X2)) ),
    inference(er,[status(thm)],[c_0_11]) ).

cnf(c_0_19,negated_conjecture,
    incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sum(sk14,sk15)),
    inference(spm,[status(thm)],[c_0_8,c_0_12]) ).

cnf(c_0_20,negated_conjecture,
    ~ incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk14),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,plain,
    ( incident_c(X1,sum(X2,X3))
    | ~ incident_c(X1,X3) ),
    inference(er,[status(thm)],[c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    ( incident_c(X1,sk16)
    | ~ incident_c(X1,sk15) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk15),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    ~ incident_c(ax0_sk1(sum(sk14,sk15),sum(sk14,sk16)),sk16),
    inference(spm,[status(thm)],[c_0_13,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : GEO083-1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Oct  3 07:02:51 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.19/0.52  Running first-order model finding
% 0.19/0.52  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.jycAt3Rx5M/E---3.1_4374.p
% 0.19/0.55  # Version: 3.1pre001
% 0.19/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.55  # Starting sh5l with 300s (1) cores
% 0.19/0.55  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4500 completed with status 0
% 0.19/0.55  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.55  # No SInE strategy applied
% 0.19/0.55  # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.19/0.55  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.55  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 737s (1) cores
% 0.19/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.55  # Starting new_bool_3 with 189s (1) cores
% 0.19/0.55  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.19/0.55  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.55  # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 4509 completed with status 0
% 0.19/0.55  # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.19/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.55  # No SInE strategy applied
% 0.19/0.55  # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.19/0.55  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.55  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 737s (1) cores
% 0.19/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.55  # Starting new_bool_3 with 189s (1) cores
% 0.19/0.55  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.19/0.55  # Preprocessing time       : 0.003 s
% 0.19/0.55  # Presaturation interreduction done
% 0.19/0.55  
% 0.19/0.55  # Proof found!
% 0.19/0.55  # SZS status Unsatisfiable
% 0.19/0.55  # SZS output start CNFRefutation
% See solution above
% 0.19/0.55  # Parsed axioms                        : 52
% 0.19/0.55  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.55  # Initial clauses                      : 52
% 0.19/0.55  # Removed in clause preprocessing      : 5
% 0.19/0.55  # Initial clauses in saturation        : 47
% 0.19/0.55  # Processed clauses                    : 113
% 0.19/0.55  # ...of these trivial                  : 1
% 0.19/0.55  # ...subsumed                          : 4
% 0.19/0.55  # ...remaining for further processing  : 108
% 0.19/0.55  # Other redundant clauses eliminated   : 4
% 0.19/0.55  # Clauses deleted for lack of memory   : 0
% 0.19/0.55  # Backward-subsumed                    : 0
% 0.19/0.55  # Backward-rewritten                   : 0
% 0.19/0.55  # Generated clauses                    : 64
% 0.19/0.55  # ...of the previous two non-redundant : 57
% 0.19/0.55  # ...aggressively subsumed             : 0
% 0.19/0.55  # Contextual simplify-reflections      : 0
% 0.19/0.55  # Paramodulations                      : 60
% 0.19/0.55  # Factorizations                       : 0
% 0.19/0.55  # NegExts                              : 0
% 0.19/0.55  # Equation resolutions                 : 4
% 0.19/0.55  # Total rewrite steps                  : 3
% 0.19/0.55  # Propositional unsat checks           : 0
% 0.19/0.55  #    Propositional check models        : 0
% 0.19/0.55  #    Propositional check unsatisfiable : 0
% 0.19/0.55  #    Propositional clauses             : 0
% 0.19/0.55  #    Propositional clauses after purity: 0
% 0.19/0.55  #    Propositional unsat core size     : 0
% 0.19/0.55  #    Propositional preprocessing time  : 0.000
% 0.19/0.55  #    Propositional encoding time       : 0.000
% 0.19/0.55  #    Propositional solver time         : 0.000
% 0.19/0.55  #    Success case prop preproc time    : 0.000
% 0.19/0.55  #    Success case prop encoding time   : 0.000
% 0.19/0.55  #    Success case prop solver time     : 0.000
% 0.19/0.55  # Current number of processed clauses  : 57
% 0.19/0.55  #    Positive orientable unit clauses  : 13
% 0.19/0.55  #    Positive unorientable unit clauses: 0
% 0.19/0.55  #    Negative unit clauses             : 6
% 0.19/0.55  #    Non-unit-clauses                  : 38
% 0.19/0.55  # Current number of unprocessed clauses: 38
% 0.19/0.55  # ...number of literals in the above   : 141
% 0.19/0.55  # Current number of archived formulas  : 0
% 0.19/0.55  # Current number of archived clauses   : 47
% 0.19/0.55  # Clause-clause subsumption calls (NU) : 740
% 0.19/0.55  # Rec. Clause-clause subsumption calls : 434
% 0.19/0.55  # Non-unit clause-clause subsumptions  : 4
% 0.19/0.55  # Unit Clause-clause subsumption calls : 33
% 0.19/0.55  # Rewrite failures with RHS unbound    : 0
% 0.19/0.55  # BW rewrite match attempts            : 2
% 0.19/0.55  # BW rewrite match successes           : 0
% 0.19/0.55  # Condensation attempts                : 0
% 0.19/0.55  # Condensation successes               : 0
% 0.19/0.55  # Termbank termtop insertions          : 2104
% 0.19/0.55  
% 0.19/0.55  # -------------------------------------------------
% 0.19/0.55  # User time                : 0.011 s
% 0.19/0.55  # System time              : 0.004 s
% 0.19/0.55  # Total time               : 0.015 s
% 0.19/0.55  # Maximum resident set size: 1700 pages
% 0.19/0.55  
% 0.19/0.55  # -------------------------------------------------
% 0.19/0.55  # User time                : 0.047 s
% 0.19/0.55  # System time              : 0.015 s
% 0.19/0.55  # Total time               : 0.062 s
% 0.19/0.55  # Maximum resident set size: 1720 pages
% 0.19/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------