TSTP Solution File: SET144-6 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SET144-6 : TPTP v8.1.2. Bugfixed v2.1.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 19:22:16 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(not_subclass_members2,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.dZyNs2T8Vg/E---3.1_31983.p',not_subclass_members2) ).

cnf(intersection3,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.dZyNs2T8Vg/E---3.1_31983.p',intersection3) ).

cnf(intersection1,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.dZyNs2T8Vg/E---3.1_31983.p',intersection1) ).

cnf(not_subclass_members1,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.dZyNs2T8Vg/E---3.1_31983.p',not_subclass_members1) ).

cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.dZyNs2T8Vg/E---3.1_31983.p',intersection2) ).

cnf(subclass_implies_equal,axiom,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.dZyNs2T8Vg/E---3.1_31983.p',subclass_implies_equal) ).

cnf(prove_commutativity_of_intersection_1,negated_conjecture,
    intersection(x,y) != intersection(y,x),
    file('/export/starexec/sandbox2/tmp/tmp.dZyNs2T8Vg/E---3.1_31983.p',prove_commutativity_of_intersection_1) ).

cnf(c_0_7,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    not_subclass_members2 ).

cnf(c_0_8,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    intersection3 ).

cnf(c_0_9,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection1 ).

cnf(c_0_10,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    not_subclass_members1 ).

cnf(c_0_11,plain,
    ( subclass(X1,intersection(X2,X3))
    | ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
    | ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( member(not_subclass_element(intersection(X1,X2),X3),X1)
    | subclass(intersection(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection2 ).

cnf(c_0_14,plain,
    ( subclass(intersection(X1,X2),intersection(X3,X1))
    | ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ( member(not_subclass_element(intersection(X1,X2),X3),X2)
    | subclass(intersection(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_16,axiom,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    subclass_implies_equal ).

cnf(c_0_17,plain,
    subclass(intersection(X1,X2),intersection(X2,X1)),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    intersection(x,y) != intersection(y,x),
    prove_commutativity_of_intersection_1 ).

cnf(c_0_19,plain,
    intersection(X1,X2) = intersection(X2,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17])]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SET144-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n019.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 2400
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon Oct  2 17:11:36 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.21/0.50  Running first-order model finding
% 0.21/0.50  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.dZyNs2T8Vg/E---3.1_31983.p
% 3.69/1.02  # Version: 3.1pre001
% 3.69/1.02  # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.69/1.02  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.69/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.69/1.02  # Starting new_bool_3 with 300s (1) cores
% 3.69/1.02  # Starting new_bool_1 with 300s (1) cores
% 3.69/1.02  # Starting sh5l with 300s (1) cores
% 3.69/1.02  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32060 completed with status 0
% 3.69/1.02  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.69/1.02  # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.69/1.02  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.69/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.69/1.02  # No SInE strategy applied
% 3.69/1.02  # Search class: FGHSM-FFLM31-DFFFFFNN
% 3.69/1.02  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.69/1.02  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 3.69/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.69/1.02  # Starting new_bool_1 with 308s (1) cores
% 3.69/1.02  # Starting sh5l with 304s (1) cores
% 3.69/1.02  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.69/1.02  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32070 completed with status 0
% 3.69/1.02  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.69/1.02  # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.69/1.02  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.69/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.69/1.02  # No SInE strategy applied
% 3.69/1.02  # Search class: FGHSM-FFLM31-DFFFFFNN
% 3.69/1.02  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.69/1.02  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 3.69/1.02  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.69/1.02  # Preprocessing time       : 0.003 s
% 3.69/1.02  # Presaturation interreduction done
% 3.69/1.02  
% 3.69/1.02  # Proof found!
% 3.69/1.02  # SZS status Unsatisfiable
% 3.69/1.02  # SZS output start CNFRefutation
% See solution above
% 3.69/1.02  # Parsed axioms                        : 113
% 3.69/1.02  # Removed by relevancy pruning/SinE    : 0
% 3.69/1.02  # Initial clauses                      : 113
% 3.69/1.02  # Removed in clause preprocessing      : 17
% 3.69/1.02  # Initial clauses in saturation        : 96
% 3.69/1.02  # Processed clauses                    : 4610
% 3.69/1.02  # ...of these trivial                  : 116
% 3.69/1.02  # ...subsumed                          : 3149
% 3.69/1.02  # ...remaining for further processing  : 1345
% 3.69/1.02  # Other redundant clauses eliminated   : 18
% 3.69/1.02  # Clauses deleted for lack of memory   : 0
% 3.69/1.02  # Backward-subsumed                    : 44
% 3.69/1.02  # Backward-rewritten                   : 356
% 3.69/1.02  # Generated clauses                    : 21513
% 3.69/1.02  # ...of the previous two non-redundant : 17879
% 3.69/1.02  # ...aggressively subsumed             : 0
% 3.69/1.02  # Contextual simplify-reflections      : 27
% 3.69/1.02  # Paramodulations                      : 21481
% 3.69/1.02  # Factorizations                       : 14
% 3.69/1.02  # NegExts                              : 0
% 3.69/1.02  # Equation resolutions                 : 18
% 3.69/1.02  # Total rewrite steps                  : 7131
% 3.69/1.02  # Propositional unsat checks           : 0
% 3.69/1.02  #    Propositional check models        : 0
% 3.69/1.02  #    Propositional check unsatisfiable : 0
% 3.69/1.02  #    Propositional clauses             : 0
% 3.69/1.02  #    Propositional clauses after purity: 0
% 3.69/1.02  #    Propositional unsat core size     : 0
% 3.69/1.02  #    Propositional preprocessing time  : 0.000
% 3.69/1.02  #    Propositional encoding time       : 0.000
% 3.69/1.02  #    Propositional solver time         : 0.000
% 3.69/1.02  #    Success case prop preproc time    : 0.000
% 3.69/1.02  #    Success case prop encoding time   : 0.000
% 3.69/1.02  #    Success case prop solver time     : 0.000
% 3.69/1.02  # Current number of processed clauses  : 846
% 3.69/1.02  #    Positive orientable unit clauses  : 109
% 3.69/1.02  #    Positive unorientable unit clauses: 1
% 3.69/1.02  #    Negative unit clauses             : 11
% 3.69/1.02  #    Non-unit-clauses                  : 725
% 3.69/1.02  # Current number of unprocessed clauses: 13111
% 3.69/1.02  # ...number of literals in the above   : 46576
% 3.69/1.02  # Current number of archived formulas  : 0
% 3.69/1.02  # Current number of archived clauses   : 512
% 3.69/1.02  # Clause-clause subsumption calls (NU) : 134560
% 3.69/1.02  # Rec. Clause-clause subsumption calls : 74221
% 3.69/1.02  # Non-unit clause-clause subsumptions  : 2482
% 3.69/1.02  # Unit Clause-clause subsumption calls : 4766
% 3.69/1.02  # Rewrite failures with RHS unbound    : 0
% 3.69/1.02  # BW rewrite match attempts            : 509
% 3.69/1.02  # BW rewrite match successes           : 385
% 3.69/1.02  # Condensation attempts                : 0
% 3.69/1.02  # Condensation successes               : 0
% 3.69/1.02  # Termbank termtop insertions          : 826079
% 3.69/1.02  
% 3.69/1.02  # -------------------------------------------------
% 3.69/1.02  # User time                : 0.431 s
% 3.69/1.02  # System time              : 0.016 s
% 3.69/1.02  # Total time               : 0.446 s
% 3.69/1.02  # Maximum resident set size: 2000 pages
% 3.69/1.02  
% 3.69/1.02  # -------------------------------------------------
% 3.69/1.02  # User time                : 2.094 s
% 3.69/1.02  # System time              : 0.041 s
% 3.69/1.02  # Total time               : 2.135 s
% 3.69/1.02  # Maximum resident set size: 1772 pages
% 3.69/1.02  % E---3.1 exiting
%------------------------------------------------------------------------------