TSTP Solution File: SET113-7 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET113-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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 : Sat May  4 09:22:16 EDT 2024

% Result   : Unsatisfiable 0.20s 0.54s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   7 unt;   2 nHn;   7 RR)
%            Number of literals    :   11 (   5 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :    2 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_unique_1st_and_2nd_in_pair_of_non_sets1_1,negated_conjecture,
    ~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox/tmp/tmp.HKrdCENSL7/E---3.1_6229.p',prove_unique_1st_and_2nd_in_pair_of_non_sets1_1) ).

cnf(prove_unique_1st_in_pair_of_non_sets,negated_conjecture,
    first(x) != x,
    file('/export/starexec/sandbox/tmp/tmp.HKrdCENSL7/E---3.1_6229.p',prove_unique_1st_in_pair_of_non_sets) ).

cnf(existence_of_1st_and_2nd_2,axiom,
    ( member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class))
    | first(X1) = X1 ),
    file('/export/starexec/sandbox/tmp/tmp.HKrdCENSL7/E---3.1_6229.p',existence_of_1st_and_2nd_2) ).

cnf(c_0_3,negated_conjecture,
    ~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)),
    inference(fof_simplification,[status(thm)],[prove_unique_1st_and_2nd_in_pair_of_non_sets1_1]) ).

cnf(c_0_4,negated_conjecture,
    first(x) != x,
    inference(fof_simplification,[status(thm)],[prove_unique_1st_in_pair_of_non_sets]) ).

cnf(c_0_5,negated_conjecture,
    ~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)),
    c_0_3 ).

cnf(c_0_6,axiom,
    ( member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class))
    | first(X1) = X1 ),
    existence_of_1st_and_2nd_2 ).

cnf(c_0_7,negated_conjecture,
    first(x) != x,
    c_0_4 ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SET113-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n020.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   : Fri May  3 10:23:31 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.20/0.50  Running first-order model finding
% 0.20/0.50  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.HKrdCENSL7/E---3.1_6229.p
% 0.20/0.54  # Version: 3.1.0
% 0.20/0.54  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54  # Starting sh5l with 300s (1) cores
% 0.20/0.54  # sh5l with pid 6337 completed with status 0
% 0.20/0.54  # Result found by sh5l
% 0.20/0.54  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54  # Starting sh5l with 300s (1) cores
% 0.20/0.54  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54  # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.20/0.54  # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.20/0.54  # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 6343 completed with status 0
% 0.20/0.54  # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.20/0.54  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54  # Starting sh5l with 300s (1) cores
% 0.20/0.54  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54  # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.20/0.54  # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.20/0.54  # Preprocessing time       : 0.003 s
% 0.20/0.54  # Presaturation interreduction done
% 0.20/0.54  
% 0.20/0.54  # Proof found!
% 0.20/0.54  # SZS status Unsatisfiable
% 0.20/0.54  # SZS output start CNFRefutation
% See solution above
% 0.20/0.54  # Parsed axioms                        : 161
% 0.20/0.54  # Removed by relevancy pruning/SinE    : 8
% 0.20/0.54  # Initial clauses                      : 153
% 0.20/0.54  # Removed in clause preprocessing      : 0
% 0.20/0.54  # Initial clauses in saturation        : 153
% 0.20/0.54  # Processed clauses                    : 258
% 0.20/0.54  # ...of these trivial                  : 3
% 0.20/0.54  # ...subsumed                          : 9
% 0.20/0.54  # ...remaining for further processing  : 246
% 0.20/0.54  # Other redundant clauses eliminated   : 9
% 0.20/0.54  # Clauses deleted for lack of memory   : 0
% 0.20/0.54  # Backward-subsumed                    : 0
% 0.20/0.54  # Backward-rewritten                   : 2
% 0.20/0.54  # Generated clauses                    : 139
% 0.20/0.54  # ...of the previous two non-redundant : 96
% 0.20/0.54  # ...aggressively subsumed             : 0
% 0.20/0.54  # Contextual simplify-reflections      : 1
% 0.20/0.54  # Paramodulations                      : 130
% 0.20/0.54  # Factorizations                       : 0
% 0.20/0.54  # NegExts                              : 0
% 0.20/0.54  # Equation resolutions                 : 9
% 0.20/0.54  # Disequality decompositions           : 0
% 0.20/0.54  # Total rewrite steps                  : 67
% 0.20/0.54  # ...of those cached                   : 37
% 0.20/0.54  # Propositional unsat checks           : 0
% 0.20/0.54  #    Propositional check models        : 0
% 0.20/0.54  #    Propositional check unsatisfiable : 0
% 0.20/0.54  #    Propositional clauses             : 0
% 0.20/0.54  #    Propositional clauses after purity: 0
% 0.20/0.54  #    Propositional unsat core size     : 0
% 0.20/0.54  #    Propositional preprocessing time  : 0.000
% 0.20/0.54  #    Propositional encoding time       : 0.000
% 0.20/0.54  #    Propositional solver time         : 0.000
% 0.20/0.54  #    Success case prop preproc time    : 0.000
% 0.20/0.54  #    Success case prop encoding time   : 0.000
% 0.20/0.54  #    Success case prop solver time     : 0.000
% 0.20/0.54  # Current number of processed clauses  : 92
% 0.20/0.54  #    Positive orientable unit clauses  : 25
% 0.20/0.54  #    Positive unorientable unit clauses: 1
% 0.20/0.54  #    Negative unit clauses             : 6
% 0.20/0.54  #    Non-unit-clauses                  : 60
% 0.20/0.54  # Current number of unprocessed clauses: 135
% 0.20/0.54  # ...number of literals in the above   : 304
% 0.20/0.54  # Current number of archived formulas  : 0
% 0.20/0.54  # Current number of archived clauses   : 151
% 0.20/0.54  # Clause-clause subsumption calls (NU) : 2338
% 0.20/0.54  # Rec. Clause-clause subsumption calls : 1886
% 0.20/0.54  # Non-unit clause-clause subsumptions  : 10
% 0.20/0.54  # Unit Clause-clause subsumption calls : 368
% 0.20/0.54  # Rewrite failures with RHS unbound    : 0
% 0.20/0.54  # BW rewrite match attempts            : 21
% 0.20/0.54  # BW rewrite match successes           : 15
% 0.20/0.54  # Condensation attempts                : 0
% 0.20/0.54  # Condensation successes               : 0
% 0.20/0.54  # Termbank termtop insertions          : 6180
% 0.20/0.54  # Search garbage collected termcells   : 274
% 0.20/0.54  
% 0.20/0.54  # -------------------------------------------------
% 0.20/0.54  # User time                : 0.022 s
% 0.20/0.54  # System time              : 0.002 s
% 0.20/0.54  # Total time               : 0.025 s
% 0.20/0.54  # Maximum resident set size: 2060 pages
% 0.20/0.54  
% 0.20/0.54  # -------------------------------------------------
% 0.20/0.54  # User time                : 0.027 s
% 0.20/0.54  # System time              : 0.004 s
% 0.20/0.54  # Total time               : 0.031 s
% 0.20/0.54  # Maximum resident set size: 1816 pages
% 0.20/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------