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

View Problem - Process Solution

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

% Computer : n017.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:19 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(subclass_implies_equal,axiom,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).

cnf(prove_corollary_of_null_class_is_subclass_2,negated_conjecture,
    x != null_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_of_null_class_is_subclass_2) ).

cnf(prove_corollary_of_null_class_is_subclass_1,negated_conjecture,
    subclass(x,null_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_of_null_class_is_subclass_1) ).

cnf(null_class_is_subclass,axiom,
    subclass(null_class,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',null_class_is_subclass) ).

cnf(c_0_4,plain,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).

cnf(c_0_5,negated_conjecture,
    x != null_class,
    inference(fof_simplification,[status(thm)],[prove_corollary_of_null_class_is_subclass_2]) ).

cnf(c_0_6,plain,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    c_0_4 ).

cnf(c_0_7,negated_conjecture,
    subclass(x,null_class),
    prove_corollary_of_null_class_is_subclass_1 ).

cnf(c_0_8,axiom,
    subclass(null_class,X1),
    null_class_is_subclass ).

cnf(c_0_9,negated_conjecture,
    x != null_class,
    c_0_5 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET063-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.13/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n017.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   : Mon May 20 12:42:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.50  # Version: 3.1.0
% 0.20/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # new_bool_3 with pid 32172 completed with status 0
% 0.20/0.50  # Result found by new_bool_3
% 0.20/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FHUSS-FFSF22-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.20/0.50  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 32175 completed with status 0
% 0.20/0.50  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FHUSS-FFSF22-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.002 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Unsatisfiable
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 106
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 90
% 0.20/0.50  # Initial clauses                      : 16
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 16
% 0.20/0.50  # Processed clauses                    : 23
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 0
% 0.20/0.50  # ...remaining for further processing  : 23
% 0.20/0.50  # Other redundant clauses eliminated   : 2
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 0
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 5
% 0.20/0.50  # ...of the previous two non-redundant : 0
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 3
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 2
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 3
% 0.20/0.50  # ...of those cached                   : 1
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 7
% 0.20/0.50  #    Positive orientable unit clauses  : 4
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 2
% 0.20/0.50  #    Non-unit-clauses                  : 1
% 0.20/0.50  # Current number of unprocessed clauses: 7
% 0.20/0.50  # ...number of literals in the above   : 17
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 14
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 9
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 9
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.50  # Unit Clause-clause subsumption calls : 0
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 5
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 1142
% 0.20/0.50  # Search garbage collected termcells   : 441
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.004 s
% 0.20/0.50  # System time              : 0.001 s
% 0.20/0.50  # Total time               : 0.005 s
% 0.20/0.50  # Maximum resident set size: 1732 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.006 s
% 0.20/0.50  # System time              : 0.003 s
% 0.20/0.50  # Total time               : 0.009 s
% 0.20/0.50  # Maximum resident set size: 1784 pages
% 0.20/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------