TSTP Solution File: SET025-4 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SET025-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n012.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 19:21:41 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
    ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
    file('/export/starexec/sandbox/tmp/tmp.Fjm9gJ5UT1/E---3.1_17564.p',ordered_pair) ).

cnf(singleton_set,axiom,
    singleton_set(X1) = non_ordered_pair(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.Fjm9gJ5UT1/E---3.1_17564.p',singleton_set) ).

cnf(prove_ordered_pairs_are_small,negated_conjecture,
    ~ little_set(ordered_pair(a,b)),
    file('/export/starexec/sandbox/tmp/tmp.Fjm9gJ5UT1/E---3.1_17564.p',prove_ordered_pairs_are_small) ).

cnf(non_ordered_pair4,axiom,
    little_set(non_ordered_pair(X1,X2)),
    file('/export/starexec/sandbox/tmp/tmp.Fjm9gJ5UT1/E---3.1_17564.p',non_ordered_pair4) ).

cnf(c_0_4,axiom,
    ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
    ordered_pair ).

cnf(c_0_5,axiom,
    singleton_set(X1) = non_ordered_pair(X1,X1),
    singleton_set ).

cnf(c_0_6,negated_conjecture,
    ~ little_set(ordered_pair(a,b)),
    prove_ordered_pairs_are_small ).

cnf(c_0_7,plain,
    ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
    inference(rw,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ~ little_set(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    little_set(non_ordered_pair(X1,X2)),
    non_ordered_pair4 ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : SET025-4 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.12  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n012.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 17:28:05 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.15/0.43  Running first-order model finding
% 0.15/0.43  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.Fjm9gJ5UT1/E---3.1_17564.p
% 0.15/0.45  # Version: 3.1pre001
% 0.15/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  # Starting sh5l with 300s (1) cores
% 0.15/0.45  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17645 completed with status 0
% 0.15/0.45  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45  # No SInE strategy applied
% 0.15/0.45  # Search class: FGHSF-FFLS31-MFFFFFNN
% 0.15/0.45  # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.15/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.45  # Starting new_bool_3 with 216s (1) cores
% 0.15/0.45  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 0.15/0.45  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S021I with 136s (1) cores
% 0.15/0.45  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17654 completed with status 0
% 0.15/0.45  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.45  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45  # No SInE strategy applied
% 0.15/0.45  # Search class: FGHSF-FFLS31-MFFFFFNN
% 0.15/0.45  # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.15/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.15/0.45  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.45  # Preprocessing time       : 0.002 s
% 0.15/0.45  # Presaturation interreduction done
% 0.15/0.45  
% 0.15/0.45  # Proof found!
% 0.15/0.45  # SZS status Unsatisfiable
% 0.15/0.45  # SZS output start CNFRefutation
% See solution above
% 0.15/0.45  # Parsed axioms                        : 142
% 0.15/0.45  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.45  # Initial clauses                      : 142
% 0.15/0.45  # Removed in clause preprocessing      : 6
% 0.15/0.45  # Initial clauses in saturation        : 136
% 0.15/0.45  # Processed clauses                    : 5
% 0.15/0.45  # ...of these trivial                  : 0
% 0.15/0.45  # ...subsumed                          : 0
% 0.15/0.45  # ...remaining for further processing  : 5
% 0.15/0.45  # Other redundant clauses eliminated   : 0
% 0.15/0.45  # Clauses deleted for lack of memory   : 0
% 0.15/0.45  # Backward-subsumed                    : 0
% 0.15/0.45  # Backward-rewritten                   : 1
% 0.15/0.45  # Generated clauses                    : 0
% 0.15/0.45  # ...of the previous two non-redundant : 0
% 0.15/0.45  # ...aggressively subsumed             : 0
% 0.15/0.45  # Contextual simplify-reflections      : 0
% 0.15/0.45  # Paramodulations                      : 0
% 0.15/0.45  # Factorizations                       : 0
% 0.15/0.45  # NegExts                              : 0
% 0.15/0.45  # Equation resolutions                 : 0
% 0.15/0.45  # Total rewrite steps                  : 1
% 0.15/0.45  # Propositional unsat checks           : 0
% 0.15/0.45  #    Propositional check models        : 0
% 0.15/0.45  #    Propositional check unsatisfiable : 0
% 0.15/0.45  #    Propositional clauses             : 0
% 0.15/0.45  #    Propositional clauses after purity: 0
% 0.15/0.45  #    Propositional unsat core size     : 0
% 0.15/0.45  #    Propositional preprocessing time  : 0.000
% 0.15/0.45  #    Propositional encoding time       : 0.000
% 0.15/0.45  #    Propositional solver time         : 0.000
% 0.15/0.45  #    Success case prop preproc time    : 0.000
% 0.15/0.45  #    Success case prop encoding time   : 0.000
% 0.15/0.45  #    Success case prop solver time     : 0.000
% 0.15/0.45  # Current number of processed clauses  : 4
% 0.15/0.45  #    Positive orientable unit clauses  : 3
% 0.15/0.45  #    Positive unorientable unit clauses: 0
% 0.15/0.45  #    Negative unit clauses             : 1
% 0.15/0.45  #    Non-unit-clauses                  : 0
% 0.15/0.45  # Current number of unprocessed clauses: 131
% 0.15/0.45  # ...number of literals in the above   : 345
% 0.15/0.45  # Current number of archived formulas  : 0
% 0.15/0.45  # Current number of archived clauses   : 7
% 0.15/0.45  # Clause-clause subsumption calls (NU) : 0
% 0.15/0.45  # Rec. Clause-clause subsumption calls : 0
% 0.15/0.45  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.45  # Unit Clause-clause subsumption calls : 0
% 0.15/0.45  # Rewrite failures with RHS unbound    : 0
% 0.15/0.45  # BW rewrite match attempts            : 1
% 0.15/0.45  # BW rewrite match successes           : 1
% 0.15/0.45  # Condensation attempts                : 0
% 0.15/0.45  # Condensation successes               : 0
% 0.15/0.45  # Termbank termtop insertions          : 2573
% 0.15/0.45  
% 0.15/0.45  # -------------------------------------------------
% 0.15/0.45  # User time                : 0.002 s
% 0.15/0.45  # System time              : 0.006 s
% 0.15/0.45  # Total time               : 0.008 s
% 0.15/0.45  # Maximum resident set size: 2088 pages
% 0.15/0.45  
% 0.15/0.45  # -------------------------------------------------
% 0.15/0.45  # User time                : 0.015 s
% 0.15/0.45  # System time              : 0.012 s
% 0.15/0.45  # Total time               : 0.027 s
% 0.15/0.45  # Maximum resident set size: 1804 pages
% 0.15/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------