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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET108-6 : TPTP v8.2.0. 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 : Tue May 21 02:57:39 EDT 2024

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   10 (   7 unt;   0 nHn;  10 RR)
%            Number of literals    :   13 (   4 equ;   6 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    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :    9 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cartesian_product4,axiom,
    ( ordered_pair(first(X1),second(X1)) = X1
    | ~ member(X1,cross_product(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).

cnf(prove_existence_of_1st_and_2nd_1_2,negated_conjecture,
    ~ member(ordered_pair(first(ordered_pair(y,z)),second(ordered_pair(y,z))),cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_existence_of_1st_and_2nd_1_2) ).

cnf(prove_existence_of_1st_and_2nd_1_1,negated_conjecture,
    member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_existence_of_1st_and_2nd_1_1) ).

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

cnf(c_0_4,negated_conjecture,
    ~ member(ordered_pair(first(ordered_pair(y,z)),second(ordered_pair(y,z))),cross_product(universal_class,universal_class)),
    inference(fof_simplification,[status(thm)],[prove_existence_of_1st_and_2nd_1_2]) ).

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

cnf(c_0_6,negated_conjecture,
    member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
    prove_existence_of_1st_and_2nd_1_1 ).

cnf(c_0_7,negated_conjecture,
    ~ member(ordered_pair(first(ordered_pair(y,z)),second(ordered_pair(y,z))),cross_product(universal_class,universal_class)),
    c_0_4 ).

cnf(c_0_8,negated_conjecture,
    ordered_pair(first(ordered_pair(y,z)),second(ordered_pair(y,z))) = ordered_pair(y,z),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SET108-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.12/0.35  % Computer : n018.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 300
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Mon May 20 12:39:38 EDT 2024
% 0.12/0.35  % CPUTime    : 
% 0.20/0.49  Running first-order model finding
% 0.20/0.49  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/benchmark/theBenchmark.p
% 0.20/0.51  # Version: 3.1.0
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # new_bool_3 with pid 3522 completed with status 0
% 0.20/0.51  # Result found by new_bool_3
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FHUSF-FFSF21-MFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51  # SAT001_MinMin_p005000_rr_RG with pid 3525 completed with status 0
% 0.20/0.51  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FHUSF-FFSF21-MFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.004 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # Proof found!
% 0.20/0.51  # SZS status Unsatisfiable
% 0.20/0.51  # SZS output start CNFRefutation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 93
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 82
% 0.20/0.51  # Initial clauses                      : 11
% 0.20/0.51  # Removed in clause preprocessing      : 0
% 0.20/0.51  # Initial clauses in saturation        : 11
% 0.20/0.51  # Processed clauses                    : 26
% 0.20/0.51  # ...of these trivial                  : 0
% 0.20/0.51  # ...subsumed                          : 0
% 0.20/0.51  # ...remaining for further processing  : 26
% 0.20/0.51  # Other redundant clauses eliminated   : 2
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 0
% 0.20/0.51  # Backward-rewritten                   : 1
% 0.20/0.51  # Generated clauses                    : 15
% 0.20/0.51  # ...of the previous two non-redundant : 8
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 0
% 0.20/0.51  # Paramodulations                      : 13
% 0.20/0.51  # Factorizations                       : 0
% 0.20/0.51  # NegExts                              : 0
% 0.20/0.51  # Equation resolutions                 : 2
% 0.20/0.51  # Disequality decompositions           : 0
% 0.20/0.51  # Total rewrite steps                  : 3
% 0.20/0.51  # ...of those cached                   : 0
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 13
% 0.20/0.51  #    Positive orientable unit clauses  : 6
% 0.20/0.51  #    Positive unorientable unit clauses: 0
% 0.20/0.51  #    Negative unit clauses             : 0
% 0.20/0.51  #    Non-unit-clauses                  : 7
% 0.20/0.51  # Current number of unprocessed clauses: 3
% 0.20/0.51  # ...number of literals in the above   : 7
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 11
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 4
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 4
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.51  # Unit Clause-clause subsumption calls : 0
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 3
% 0.20/0.51  # BW rewrite match successes           : 1
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 1159
% 0.20/0.51  # Search garbage collected termcells   : 409
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.004 s
% 0.20/0.51  # System time              : 0.004 s
% 0.20/0.51  # Total time               : 0.009 s
% 0.20/0.51  # Maximum resident set size: 1872 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.008 s
% 0.20/0.51  # System time              : 0.007 s
% 0.20/0.51  # Total time               : 0.015 s
% 0.20/0.51  # Maximum resident set size: 1776 pages
% 0.20/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------