TSTP Solution File: SET018-7 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET018-7 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n027.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:56:58 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(ordered_pair_determines_components2,axiom,
    ( X2 = X4
    | ordered_pair(X1,X2) != ordered_pair(X3,X4)
    | ~ member(X2,universal_class) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_determines_components2) ).

cnf(prove_ordered_pair_determines_components2_1,negated_conjecture,
    ordered_pair(w,x) = ordered_pair(y,z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_1) ).

cnf(prove_ordered_pair_determines_components2_2,negated_conjecture,
    member(x,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_2) ).

cnf(prove_ordered_pair_determines_components2_3,negated_conjecture,
    x != z,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_3) ).

cnf(c_0_4,plain,
    ( X2 = X4
    | ordered_pair(X1,X2) != ordered_pair(X3,X4)
    | ~ member(X2,universal_class) ),
    inference(fof_simplification,[status(thm)],[ordered_pair_determines_components2]) ).

cnf(c_0_5,plain,
    ( X2 = X4
    | ordered_pair(X1,X2) != ordered_pair(X3,X4)
    | ~ member(X2,universal_class) ),
    c_0_4 ).

cnf(c_0_6,negated_conjecture,
    ordered_pair(w,x) = ordered_pair(y,z),
    prove_ordered_pair_determines_components2_1 ).

cnf(c_0_7,negated_conjecture,
    member(x,universal_class),
    prove_ordered_pair_determines_components2_2 ).

cnf(c_0_8,negated_conjecture,
    x != z,
    inference(fof_simplification,[status(thm)],[prove_ordered_pair_determines_components2_3]) ).

cnf(c_0_9,negated_conjecture,
    ( x = X1
    | ordered_pair(y,z) != ordered_pair(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).

cnf(c_0_10,negated_conjecture,
    x != z,
    c_0_8 ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SET018-7 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.11/0.34  % Computer : n027.cluster.edu
% 0.11/0.34  % Model    : x86_64 x86_64
% 0.11/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34  % Memory   : 8042.1875MB
% 0.11/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34  % CPULimit   : 300
% 0.11/0.34  % WCLimit    : 300
% 0.11/0.34  % DateTime   : Mon May 20 12:18:53 EDT 2024
% 0.11/0.34  % CPUTime    : 
% 0.18/0.46  Running first-order model finding
% 0.18/0.46  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.18/0.48  # Version: 3.1.0
% 0.18/0.48  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # Starting sh5l with 300s (1) cores
% 0.18/0.48  # new_bool_3 with pid 9793 completed with status 0
% 0.18/0.48  # Result found by new_bool_3
% 0.18/0.48  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48  # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.18/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.48  # SAT001_MinMin_p005000_rr_RG with pid 9796 completed with status 0
% 0.18/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.48  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48  # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.18/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.48  # Preprocessing time       : 0.002 s
% 0.18/0.48  # Presaturation interreduction done
% 0.18/0.48  
% 0.18/0.48  # Proof found!
% 0.18/0.48  # SZS status Unsatisfiable
% 0.18/0.48  # SZS output start CNFRefutation
% See solution above
% 0.18/0.48  # Parsed axioms                        : 170
% 0.18/0.48  # Removed by relevancy pruning/SinE    : 110
% 0.18/0.48  # Initial clauses                      : 60
% 0.18/0.48  # Removed in clause preprocessing      : 0
% 0.18/0.48  # Initial clauses in saturation        : 60
% 0.18/0.48  # Processed clauses                    : 124
% 0.18/0.48  # ...of these trivial                  : 0
% 0.18/0.48  # ...subsumed                          : 13
% 0.18/0.48  # ...remaining for further processing  : 111
% 0.18/0.48  # Other redundant clauses eliminated   : 2
% 0.18/0.48  # Clauses deleted for lack of memory   : 0
% 0.18/0.48  # Backward-subsumed                    : 1
% 0.18/0.48  # Backward-rewritten                   : 2
% 0.18/0.48  # Generated clauses                    : 131
% 0.18/0.48  # ...of the previous two non-redundant : 85
% 0.18/0.48  # ...aggressively subsumed             : 0
% 0.18/0.48  # Contextual simplify-reflections      : 0
% 0.18/0.48  # Paramodulations                      : 125
% 0.18/0.48  # Factorizations                       : 0
% 0.18/0.48  # NegExts                              : 0
% 0.18/0.48  # Equation resolutions                 : 6
% 0.18/0.48  # Disequality decompositions           : 0
% 0.18/0.48  # Total rewrite steps                  : 40
% 0.18/0.48  # ...of those cached                   : 18
% 0.18/0.48  # Propositional unsat checks           : 0
% 0.18/0.48  #    Propositional check models        : 0
% 0.18/0.48  #    Propositional check unsatisfiable : 0
% 0.18/0.48  #    Propositional clauses             : 0
% 0.18/0.48  #    Propositional clauses after purity: 0
% 0.18/0.48  #    Propositional unsat core size     : 0
% 0.18/0.48  #    Propositional preprocessing time  : 0.000
% 0.18/0.48  #    Propositional encoding time       : 0.000
% 0.18/0.48  #    Propositional solver time         : 0.000
% 0.18/0.48  #    Success case prop preproc time    : 0.000
% 0.18/0.48  #    Success case prop encoding time   : 0.000
% 0.18/0.48  #    Success case prop solver time     : 0.000
% 0.18/0.48  # Current number of processed clauses  : 49
% 0.18/0.48  #    Positive orientable unit clauses  : 15
% 0.18/0.48  #    Positive unorientable unit clauses: 2
% 0.18/0.48  #    Negative unit clauses             : 2
% 0.18/0.48  #    Non-unit-clauses                  : 30
% 0.18/0.48  # Current number of unprocessed clauses: 77
% 0.18/0.48  # ...number of literals in the above   : 177
% 0.18/0.48  # Current number of archived formulas  : 0
% 0.18/0.48  # Current number of archived clauses   : 60
% 0.18/0.48  # Clause-clause subsumption calls (NU) : 148
% 0.18/0.48  # Rec. Clause-clause subsumption calls : 127
% 0.18/0.48  # Non-unit clause-clause subsumptions  : 11
% 0.18/0.48  # Unit Clause-clause subsumption calls : 0
% 0.18/0.48  # Rewrite failures with RHS unbound    : 0
% 0.18/0.48  # BW rewrite match attempts            : 31
% 0.18/0.48  # BW rewrite match successes           : 25
% 0.18/0.48  # Condensation attempts                : 0
% 0.18/0.48  # Condensation successes               : 0
% 0.18/0.48  # Termbank termtop insertions          : 3571
% 0.18/0.48  # Search garbage collected termcells   : 548
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.009 s
% 0.18/0.48  # System time              : 0.001 s
% 0.18/0.48  # Total time               : 0.010 s
% 0.18/0.48  # Maximum resident set size: 1864 pages
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.013 s
% 0.18/0.48  # System time              : 0.001 s
% 0.18/0.48  # Total time               : 0.014 s
% 0.18/0.48  # Maximum resident set size: 1824 pages
% 0.18/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------