TSTP Solution File: SET025-8 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET025-8 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n006.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:02 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(ordered_pair_predicate3,axiom,
    ( X1 = ordered_pair(f2(X1),f3(X1))
    | ~ ordered_pair_predicate(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate3) ).

cnf(ordered_pair,axiom,
    ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',ordered_pair) ).

cnf(singleton_set,axiom,
    singleton_set(X1) = non_ordered_pair(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',singleton_set) ).

cnf(non_ordered_pair4,axiom,
    little_set(non_ordered_pair(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',non_ordered_pair4) ).

cnf(prove_predicate_is_small,negated_conjecture,
    ~ little_set(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_predicate_is_small) ).

cnf(an_ordered_pair_predicate,hypothesis,
    ordered_pair_predicate(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_ordered_pair_predicate) ).

cnf(c_0_6,plain,
    ( X1 = ordered_pair(f2(X1),f3(X1))
    | ~ ordered_pair_predicate(X1) ),
    inference(fof_simplification,[status(thm)],[ordered_pair_predicate3]) ).

cnf(c_0_7,axiom,
    ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
    ordered_pair ).

cnf(c_0_8,axiom,
    singleton_set(X1) = non_ordered_pair(X1,X1),
    singleton_set ).

cnf(c_0_9,plain,
    ( X1 = ordered_pair(f2(X1),f3(X1))
    | ~ ordered_pair_predicate(X1) ),
    c_0_6 ).

cnf(c_0_10,plain,
    ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,axiom,
    little_set(non_ordered_pair(X1,X2)),
    non_ordered_pair4 ).

cnf(c_0_12,plain,
    ( X1 = non_ordered_pair(non_ordered_pair(f2(X1),f2(X1)),non_ordered_pair(f2(X1),f3(X1)))
    | ~ ordered_pair_predicate(X1) ),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ~ little_set(a),
    inference(fof_simplification,[status(thm)],[prove_predicate_is_small]) ).

cnf(c_0_14,plain,
    ( little_set(X1)
    | ~ ordered_pair_predicate(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,hypothesis,
    ordered_pair_predicate(a),
    an_ordered_pair_predicate ).

cnf(c_0_16,negated_conjecture,
    ~ little_set(a),
    c_0_13 ).

cnf(c_0_17,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SET025-8 : TPTP v8.2.0. Released v1.0.0.
% 0.04/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 13:18:08 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  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.53  # Version: 3.1.0
% 0.20/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53  # Starting sh5l with 300s (1) cores
% 0.20/0.53  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21080 completed with status 0
% 0.20/0.53  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53  # No SInE strategy applied
% 0.20/0.53  # Search class: FGHSS-FFLS31-MFFFFFNN
% 0.20/0.53  # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.20/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.53  # Starting new_bool_3 with 216s (1) cores
% 0.20/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 0.20/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S021I with 136s (1) cores
% 0.20/0.53  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21088 completed with status 0
% 0.20/0.53  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53  # No SInE strategy applied
% 0.20/0.53  # Search class: FGHSS-FFLS31-MFFFFFNN
% 0.20/0.53  # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.20/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.53  # Preprocessing time       : 0.003 s
% 0.20/0.53  # Presaturation interreduction done
% 0.20/0.53  
% 0.20/0.53  # Proof found!
% 0.20/0.53  # SZS status Unsatisfiable
% 0.20/0.53  # SZS output start CNFRefutation
% See solution above
% 0.20/0.53  # Parsed axioms                        : 153
% 0.20/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.53  # Initial clauses                      : 153
% 0.20/0.53  # Removed in clause preprocessing      : 6
% 0.20/0.53  # Initial clauses in saturation        : 147
% 0.20/0.53  # Processed clauses                    : 311
% 0.20/0.53  # ...of these trivial                  : 2
% 0.20/0.53  # ...subsumed                          : 0
% 0.20/0.53  # ...remaining for further processing  : 309
% 0.20/0.53  # Other redundant clauses eliminated   : 18
% 0.20/0.53  # Clauses deleted for lack of memory   : 0
% 0.20/0.53  # Backward-subsumed                    : 1
% 0.20/0.53  # Backward-rewritten                   : 0
% 0.20/0.53  # Generated clauses                    : 812
% 0.20/0.53  # ...of the previous two non-redundant : 785
% 0.20/0.53  # ...aggressively subsumed             : 0
% 0.20/0.53  # Contextual simplify-reflections      : 3
% 0.20/0.53  # Paramodulations                      : 789
% 0.20/0.53  # Factorizations                       : 2
% 0.20/0.53  # NegExts                              : 0
% 0.20/0.53  # Equation resolutions                 : 21
% 0.20/0.53  # Disequality decompositions           : 0
% 0.20/0.53  # Total rewrite steps                  : 63
% 0.20/0.53  # ...of those cached                   : 42
% 0.20/0.53  # Propositional unsat checks           : 0
% 0.20/0.53  #    Propositional check models        : 0
% 0.20/0.53  #    Propositional check unsatisfiable : 0
% 0.20/0.53  #    Propositional clauses             : 0
% 0.20/0.53  #    Propositional clauses after purity: 0
% 0.20/0.53  #    Propositional unsat core size     : 0
% 0.20/0.53  #    Propositional preprocessing time  : 0.000
% 0.20/0.53  #    Propositional encoding time       : 0.000
% 0.20/0.53  #    Propositional solver time         : 0.000
% 0.20/0.53  #    Success case prop preproc time    : 0.000
% 0.20/0.53  #    Success case prop encoding time   : 0.000
% 0.20/0.53  #    Success case prop solver time     : 0.000
% 0.20/0.53  # Current number of processed clauses  : 149
% 0.20/0.53  #    Positive orientable unit clauses  : 8
% 0.20/0.53  #    Positive unorientable unit clauses: 0
% 0.20/0.53  #    Negative unit clauses             : 3
% 0.20/0.53  #    Non-unit-clauses                  : 138
% 0.20/0.53  # Current number of unprocessed clauses: 766
% 0.20/0.53  # ...number of literals in the above   : 2068
% 0.20/0.53  # Current number of archived formulas  : 0
% 0.20/0.53  # Current number of archived clauses   : 152
% 0.20/0.53  # Clause-clause subsumption calls (NU) : 9817
% 0.20/0.53  # Rec. Clause-clause subsumption calls : 4680
% 0.20/0.53  # Non-unit clause-clause subsumptions  : 4
% 0.20/0.53  # Unit Clause-clause subsumption calls : 126
% 0.20/0.53  # Rewrite failures with RHS unbound    : 0
% 0.20/0.53  # BW rewrite match attempts            : 0
% 0.20/0.53  # BW rewrite match successes           : 0
% 0.20/0.53  # Condensation attempts                : 0
% 0.20/0.53  # Condensation successes               : 0
% 0.20/0.53  # Termbank termtop insertions          : 19962
% 0.20/0.53  # Search garbage collected termcells   : 342
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.036 s
% 0.20/0.53  # System time              : 0.005 s
% 0.20/0.53  # Total time               : 0.041 s
% 0.20/0.53  # Maximum resident set size: 2096 pages
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.171 s
% 0.20/0.53  # System time              : 0.020 s
% 0.20/0.53  # Total time               : 0.191 s
% 0.20/0.53  # Maximum resident set size: 1828 pages
% 0.20/0.53  % E---3.1 exiting
%------------------------------------------------------------------------------