TSTP Solution File: SET101-6 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET101-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n018.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:18:30 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
    unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
    file('/export/starexec/sandbox/tmp/tmp.6p1B8dLwGT/E---3.1_2891.p',ordered_pair) ).

cnf(singleton_set,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    file('/export/starexec/sandbox/tmp/tmp.6p1B8dLwGT/E---3.1_2891.p',singleton_set) ).

cnf(prove_singleton_member_of_ordered_pair_1,negated_conjecture,
    ~ member(singleton(x),ordered_pair(x,y)),
    file('/export/starexec/sandbox/tmp/tmp.6p1B8dLwGT/E---3.1_2891.p',prove_singleton_member_of_ordered_pair_1) ).

cnf(unordered_pair2,axiom,
    ( member(X1,unordered_pair(X1,X2))
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox/tmp/tmp.6p1B8dLwGT/E---3.1_2891.p',unordered_pair2) ).

cnf(unordered_pairs_in_universal,axiom,
    member(unordered_pair(X1,X2),universal_class),
    file('/export/starexec/sandbox/tmp/tmp.6p1B8dLwGT/E---3.1_2891.p',unordered_pairs_in_universal) ).

cnf(c_0_5,axiom,
    unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
    ordered_pair ).

cnf(c_0_6,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    singleton_set ).

cnf(c_0_7,negated_conjecture,
    ~ member(singleton(x),ordered_pair(x,y)),
    prove_singleton_member_of_ordered_pair_1 ).

cnf(c_0_8,plain,
    unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ member(unordered_pair(x,x),unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6]),c_0_8]) ).

cnf(c_0_10,axiom,
    ( member(X1,unordered_pair(X1,X2))
    | ~ member(X1,universal_class) ),
    unordered_pair2 ).

cnf(c_0_11,axiom,
    member(unordered_pair(X1,X2),universal_class),
    unordered_pairs_in_universal ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SET101-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n018.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 16:36:08 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/0.44  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.6p1B8dLwGT/E---3.1_2891.p
% 0.17/0.46  # Version: 3.1pre001
% 0.17/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46  # Starting sh5l with 300s (1) cores
% 0.17/0.46  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2969 completed with status 0
% 0.17/0.46  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  # No SInE strategy applied
% 0.17/0.46  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.17/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 308s (1) cores
% 0.17/0.46  # Starting sh5l with 304s (1) cores
% 0.17/0.46  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2976 completed with status 0
% 0.17/0.46  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  # No SInE strategy applied
% 0.17/0.46  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.17/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.46  # Preprocessing time       : 0.003 s
% 0.17/0.46  # Presaturation interreduction done
% 0.17/0.46  
% 0.17/0.46  # Proof found!
% 0.17/0.46  # SZS status Unsatisfiable
% 0.17/0.46  # SZS output start CNFRefutation
% See solution above
% 0.17/0.46  # Parsed axioms                        : 92
% 0.17/0.46  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.46  # Initial clauses                      : 92
% 0.17/0.46  # Removed in clause preprocessing      : 15
% 0.17/0.46  # Initial clauses in saturation        : 77
% 0.17/0.46  # Processed clauses                    : 111
% 0.17/0.46  # ...of these trivial                  : 0
% 0.17/0.46  # ...subsumed                          : 0
% 0.17/0.46  # ...remaining for further processing  : 111
% 0.17/0.46  # Other redundant clauses eliminated   : 3
% 0.17/0.46  # Clauses deleted for lack of memory   : 0
% 0.17/0.46  # Backward-subsumed                    : 0
% 0.17/0.46  # Backward-rewritten                   : 0
% 0.17/0.46  # Generated clauses                    : 16
% 0.17/0.46  # ...of the previous two non-redundant : 13
% 0.17/0.46  # ...aggressively subsumed             : 0
% 0.17/0.46  # Contextual simplify-reflections      : 0
% 0.17/0.46  # Paramodulations                      : 13
% 0.17/0.46  # Factorizations                       : 0
% 0.17/0.46  # NegExts                              : 0
% 0.17/0.46  # Equation resolutions                 : 3
% 0.17/0.46  # Total rewrite steps                  : 3
% 0.17/0.46  # Propositional unsat checks           : 0
% 0.17/0.46  #    Propositional check models        : 0
% 0.17/0.46  #    Propositional check unsatisfiable : 0
% 0.17/0.46  #    Propositional clauses             : 0
% 0.17/0.46  #    Propositional clauses after purity: 0
% 0.17/0.46  #    Propositional unsat core size     : 0
% 0.17/0.46  #    Propositional preprocessing time  : 0.000
% 0.17/0.46  #    Propositional encoding time       : 0.000
% 0.17/0.46  #    Propositional solver time         : 0.000
% 0.17/0.47  #    Success case prop preproc time    : 0.000
% 0.17/0.47  #    Success case prop encoding time   : 0.000
% 0.17/0.47  #    Success case prop solver time     : 0.000
% 0.17/0.47  # Current number of processed clauses  : 32
% 0.17/0.47  #    Positive orientable unit clauses  : 10
% 0.17/0.47  #    Positive unorientable unit clauses: 0
% 0.17/0.47  #    Negative unit clauses             : 1
% 0.17/0.47  #    Non-unit-clauses                  : 21
% 0.17/0.47  # Current number of unprocessed clauses: 55
% 0.17/0.47  # ...number of literals in the above   : 131
% 0.17/0.47  # Current number of archived formulas  : 0
% 0.17/0.47  # Current number of archived clauses   : 91
% 0.17/0.47  # Clause-clause subsumption calls (NU) : 1117
% 0.17/0.47  # Rec. Clause-clause subsumption calls : 537
% 0.17/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.47  # Unit Clause-clause subsumption calls : 7
% 0.17/0.47  # Rewrite failures with RHS unbound    : 0
% 0.17/0.47  # BW rewrite match attempts            : 4
% 0.17/0.47  # BW rewrite match successes           : 1
% 0.17/0.47  # Condensation attempts                : 0
% 0.17/0.47  # Condensation successes               : 0
% 0.17/0.47  # Termbank termtop insertions          : 5626
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.013 s
% 0.17/0.47  # System time              : 0.003 s
% 0.17/0.47  # Total time               : 0.015 s
% 0.17/0.47  # Maximum resident set size: 1944 pages
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.052 s
% 0.17/0.47  # System time              : 0.013 s
% 0.17/0.47  # Total time               : 0.065 s
% 0.17/0.47  # Maximum resident set size: 1756 pages
% 0.17/0.47  % E---3.1 exiting
% 0.17/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------