TSTP Solution File: SET236-6 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET236-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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 09:22:39 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.xDtid3JLD5/E---3.1_31836.p',subclass_members) ).

cnf(cartesian_product4,axiom,
    ( ordered_pair(first(X1),second(X1)) = X1
    | ~ member(X1,cross_product(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.xDtid3JLD5/E---3.1_31836.p',cartesian_product4) ).

cnf(prove_cross_product_property11_1,negated_conjecture,
    subclass(x,cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox2/tmp/tmp.xDtid3JLD5/E---3.1_31836.p',prove_cross_product_property11_1) ).

cnf(not_subclass_members2,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.xDtid3JLD5/E---3.1_31836.p',not_subclass_members2) ).

cnf(prove_cross_product_property11_2,negated_conjecture,
    member(ordered_pair(first(not_subclass_element(x,y)),second(not_subclass_element(x,y))),y),
    file('/export/starexec/sandbox2/tmp/tmp.xDtid3JLD5/E---3.1_31836.p',prove_cross_product_property11_2) ).

cnf(prove_cross_product_property11_3,negated_conjecture,
    ~ subclass(x,y),
    file('/export/starexec/sandbox2/tmp/tmp.xDtid3JLD5/E---3.1_31836.p',prove_cross_product_property11_3) ).

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

cnf(c_0_7,plain,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    inference(fof_simplification,[status(thm)],[subclass_members]) ).

cnf(c_0_8,plain,
    ( ordered_pair(first(X1),second(X1)) = X1
    | ~ member(X1,cross_product(X2,X3)) ),
    inference(fof_simplification,[status(thm)],[cartesian_product4]) ).

cnf(c_0_9,plain,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    c_0_7 ).

cnf(c_0_10,negated_conjecture,
    subclass(x,cross_product(universal_class,universal_class)),
    prove_cross_product_property11_1 ).

cnf(c_0_11,plain,
    ( ordered_pair(first(X1),second(X1)) = X1
    | ~ member(X1,cross_product(X2,X3)) ),
    c_0_8 ).

cnf(c_0_12,negated_conjecture,
    ( member(X1,cross_product(universal_class,universal_class))
    | ~ member(X1,x) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).

cnf(c_0_14,negated_conjecture,
    member(ordered_pair(first(not_subclass_element(x,y)),second(not_subclass_element(x,y))),y),
    prove_cross_product_property11_2 ).

cnf(c_0_15,negated_conjecture,
    ( ordered_pair(first(X1),second(X1)) = X1
    | ~ member(X1,x) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ~ subclass(x,y),
    inference(fof_simplification,[status(thm)],[prove_cross_product_property11_3]) ).

cnf(c_0_17,plain,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    c_0_13 ).

cnf(c_0_18,negated_conjecture,
    ( member(not_subclass_element(x,y),y)
    | ~ member(not_subclass_element(x,y),x) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ~ subclass(x,y),
    c_0_16 ).

cnf(c_0_20,negated_conjecture,
    ~ member(not_subclass_element(x,y),x),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

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

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SET236-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n018.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:39:46 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  Running first-order model finding
% 0.20/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.xDtid3JLD5/E---3.1_31836.p
% 0.20/0.52  # Version: 3.1.0
% 0.20/0.52  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52  # Starting sh5l with 300s (1) cores
% 0.20/0.52  # new_bool_3 with pid 31974 completed with status 0
% 0.20/0.52  # Result found by new_bool_3
% 0.20/0.52  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  # Search class: FGUSF-FFSF21-MFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52  # SAT001_MinMin_p005000_rr_RG with pid 31978 completed with status 0
% 0.20/0.52  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  # Search class: FGUSF-FFSF21-MFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52  # Preprocessing time       : 0.002 s
% 0.20/0.52  # Presaturation interreduction done
% 0.20/0.52  
% 0.20/0.52  # Proof found!
% 0.20/0.52  # SZS status Unsatisfiable
% 0.20/0.52  # SZS output start CNFRefutation
% See solution above
% 0.20/0.52  # Parsed axioms                        : 115
% 0.20/0.52  # Removed by relevancy pruning/SinE    : 101
% 0.20/0.52  # Initial clauses                      : 14
% 0.20/0.52  # Removed in clause preprocessing      : 0
% 0.20/0.52  # Initial clauses in saturation        : 14
% 0.20/0.52  # Processed clauses                    : 46
% 0.20/0.52  # ...of these trivial                  : 0
% 0.20/0.52  # ...subsumed                          : 3
% 0.20/0.52  # ...remaining for further processing  : 43
% 0.20/0.52  # Other redundant clauses eliminated   : 2
% 0.20/0.52  # Clauses deleted for lack of memory   : 0
% 0.20/0.52  # Backward-subsumed                    : 1
% 0.20/0.52  # Backward-rewritten                   : 0
% 0.20/0.52  # Generated clauses                    : 45
% 0.20/0.52  # ...of the previous two non-redundant : 36
% 0.20/0.52  # ...aggressively subsumed             : 0
% 0.20/0.52  # Contextual simplify-reflections      : 0
% 0.20/0.52  # Paramodulations                      : 43
% 0.20/0.52  # Factorizations                       : 0
% 0.20/0.52  # NegExts                              : 0
% 0.20/0.52  # Equation resolutions                 : 2
% 0.20/0.52  # Disequality decompositions           : 0
% 0.20/0.52  # Total rewrite steps                  : 5
% 0.20/0.52  # ...of those cached                   : 1
% 0.20/0.52  # Propositional unsat checks           : 0
% 0.20/0.52  #    Propositional check models        : 0
% 0.20/0.52  #    Propositional check unsatisfiable : 0
% 0.20/0.52  #    Propositional clauses             : 0
% 0.20/0.52  #    Propositional clauses after purity: 0
% 0.20/0.52  #    Propositional unsat core size     : 0
% 0.20/0.52  #    Propositional preprocessing time  : 0.000
% 0.20/0.52  #    Propositional encoding time       : 0.000
% 0.20/0.52  #    Propositional solver time         : 0.000
% 0.20/0.52  #    Success case prop preproc time    : 0.000
% 0.20/0.52  #    Success case prop encoding time   : 0.000
% 0.20/0.52  #    Success case prop solver time     : 0.000
% 0.20/0.52  # Current number of processed clauses  : 27
% 0.20/0.52  #    Positive orientable unit clauses  : 5
% 0.20/0.52  #    Positive unorientable unit clauses: 0
% 0.20/0.52  #    Negative unit clauses             : 2
% 0.20/0.52  #    Non-unit-clauses                  : 20
% 0.20/0.52  # Current number of unprocessed clauses: 17
% 0.20/0.52  # ...number of literals in the above   : 47
% 0.20/0.52  # Current number of archived formulas  : 0
% 0.20/0.52  # Current number of archived clauses   : 14
% 0.20/0.52  # Clause-clause subsumption calls (NU) : 30
% 0.20/0.52  # Rec. Clause-clause subsumption calls : 30
% 0.20/0.52  # Non-unit clause-clause subsumptions  : 3
% 0.20/0.52  # Unit Clause-clause subsumption calls : 5
% 0.20/0.52  # Rewrite failures with RHS unbound    : 0
% 0.20/0.52  # BW rewrite match attempts            : 6
% 0.20/0.52  # BW rewrite match successes           : 0
% 0.20/0.52  # Condensation attempts                : 0
% 0.20/0.52  # Condensation successes               : 0
% 0.20/0.52  # Termbank termtop insertions          : 1758
% 0.20/0.52  # Search garbage collected termcells   : 491
% 0.20/0.52  
% 0.20/0.52  # -------------------------------------------------
% 0.20/0.52  # User time                : 0.003 s
% 0.20/0.52  # System time              : 0.004 s
% 0.20/0.52  # Total time               : 0.008 s
% 0.20/0.52  # Maximum resident set size: 1904 pages
% 0.20/0.52  
% 0.20/0.52  # -------------------------------------------------
% 0.20/0.52  # User time                : 0.007 s
% 0.20/0.52  # System time              : 0.006 s
% 0.20/0.52  # Total time               : 0.013 s
% 0.20/0.52  # Maximum resident set size: 1788 pages
% 0.20/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------