TSTP Solution File: CAT006-1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n023.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 : Mon May 20 18:59:10 EDT 2024

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   30 (  16 unt;   0 nHn;  26 RR)
%            Number of literals    :   56 (   7 equ;  29 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   42 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(identity1,axiom,
    ( product(X1,X2,X2)
    | ~ defined(X1,X2)
    | ~ identity_map(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',identity1) ).

cnf(category_theory_axiom3,axiom,
    ( defined(X4,X1)
    | ~ product(X1,X2,X3)
    | ~ defined(X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',category_theory_axiom3) ).

cnf(ha_defined,hypothesis,
    defined(h,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ha_defined) ).

cnf(h_is_the_identity_map,hypothesis,
    identity_map(h),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_is_the_identity_map) ).

cnf(mapping_from_codomain_of_x_to_x,axiom,
    defined(codomain(X1),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',mapping_from_codomain_of_x_to_x) ).

cnf(composition_is_well_defined,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',composition_is_well_defined) ).

cnf(codomain_is_an_identity_map,axiom,
    identity_map(codomain(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',codomain_is_an_identity_map) ).

cnf(identity2,axiom,
    ( product(X1,X2,X1)
    | ~ defined(X1,X2)
    | ~ identity_map(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',identity2) ).

cnf(prove_codomain_of_a_is_h,negated_conjecture,
    codomain(a) != h,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_a_is_h) ).

cnf(c_0_9,plain,
    ( product(X1,X2,X2)
    | ~ defined(X1,X2)
    | ~ identity_map(X1) ),
    inference(fof_simplification,[status(thm)],[identity1]) ).

cnf(c_0_10,plain,
    ( defined(X4,X1)
    | ~ product(X1,X2,X3)
    | ~ defined(X4,X3) ),
    inference(fof_simplification,[status(thm)],[category_theory_axiom3]) ).

cnf(c_0_11,plain,
    ( product(X1,X2,X2)
    | ~ defined(X1,X2)
    | ~ identity_map(X1) ),
    c_0_9 ).

cnf(c_0_12,hypothesis,
    defined(h,a),
    ha_defined ).

cnf(c_0_13,hypothesis,
    identity_map(h),
    h_is_the_identity_map ).

cnf(c_0_14,plain,
    ( defined(X4,X1)
    | ~ product(X1,X2,X3)
    | ~ defined(X4,X3) ),
    c_0_10 ).

cnf(c_0_15,hypothesis,
    product(h,a,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_16,hypothesis,
    ( defined(X1,h)
    | ~ defined(X1,a) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,axiom,
    defined(codomain(X1),X1),
    mapping_from_codomain_of_x_to_x ).

cnf(c_0_18,plain,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    inference(fof_simplification,[status(thm)],[composition_is_well_defined]) ).

cnf(c_0_19,hypothesis,
    defined(codomain(a),h),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,axiom,
    identity_map(codomain(X1)),
    codomain_is_an_identity_map ).

cnf(c_0_21,plain,
    ( product(X1,X2,X1)
    | ~ defined(X1,X2)
    | ~ identity_map(X2) ),
    inference(fof_simplification,[status(thm)],[identity2]) ).

cnf(c_0_22,plain,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    c_0_18 ).

cnf(c_0_23,hypothesis,
    product(codomain(a),h,h),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_20])]) ).

cnf(c_0_24,plain,
    ( product(X1,X2,X1)
    | ~ defined(X1,X2)
    | ~ identity_map(X2) ),
    c_0_21 ).

cnf(c_0_25,negated_conjecture,
    codomain(a) != h,
    inference(fof_simplification,[status(thm)],[prove_codomain_of_a_is_h]) ).

cnf(c_0_26,hypothesis,
    ( X1 = h
    | ~ product(codomain(a),h,X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,hypothesis,
    product(codomain(a),h,codomain(a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_13])]) ).

cnf(c_0_28,negated_conjecture,
    codomain(a) != h,
    c_0_25 ).

cnf(c_0_29,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : CAT006-1 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n023.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.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat May 18 11:41:08 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48  # Version: 3.1.0
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1358 completed with status 0
% 0.19/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # No SInE strategy applied
% 0.19/0.48  # Search class: FHUSM-FFSF21-SFFFFFNN
% 0.19/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 811s (1) cores
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48  # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48  # Starting sh5l with 136s (1) cores
% 0.19/0.48  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1363 completed with status 0
% 0.19/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # No SInE strategy applied
% 0.19/0.48  # Search class: FHUSM-FFSF21-SFFFFFNN
% 0.19/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 811s (1) cores
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.001 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Unsatisfiable
% 0.19/0.48  # SZS output start CNFRefutation
% See solution above
% 0.19/0.48  # Parsed axioms                        : 21
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.48  # Initial clauses                      : 21
% 0.19/0.48  # Removed in clause preprocessing      : 0
% 0.19/0.48  # Initial clauses in saturation        : 21
% 0.19/0.48  # Processed clauses                    : 60
% 0.19/0.48  # ...of these trivial                  : 1
% 0.19/0.48  # ...subsumed                          : 0
% 0.19/0.48  # ...remaining for further processing  : 59
% 0.19/0.48  # Other redundant clauses eliminated   : 0
% 0.19/0.48  # Clauses deleted for lack of memory   : 0
% 0.19/0.48  # Backward-subsumed                    : 0
% 0.19/0.48  # Backward-rewritten                   : 0
% 0.19/0.48  # Generated clauses                    : 83
% 0.19/0.48  # ...of the previous two non-redundant : 62
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 0
% 0.19/0.48  # Paramodulations                      : 83
% 0.19/0.48  # Factorizations                       : 0
% 0.19/0.48  # NegExts                              : 0
% 0.19/0.48  # Equation resolutions                 : 0
% 0.19/0.48  # Disequality decompositions           : 0
% 0.19/0.48  # Total rewrite steps                  : 31
% 0.19/0.48  # ...of those cached                   : 17
% 0.19/0.48  # Propositional unsat checks           : 0
% 0.19/0.48  #    Propositional check models        : 0
% 0.19/0.48  #    Propositional check unsatisfiable : 0
% 0.19/0.48  #    Propositional clauses             : 0
% 0.19/0.48  #    Propositional clauses after purity: 0
% 0.19/0.48  #    Propositional unsat core size     : 0
% 0.19/0.48  #    Propositional preprocessing time  : 0.000
% 0.19/0.48  #    Propositional encoding time       : 0.000
% 0.19/0.48  #    Propositional solver time         : 0.000
% 0.19/0.48  #    Success case prop preproc time    : 0.000
% 0.19/0.48  #    Success case prop encoding time   : 0.000
% 0.19/0.48  #    Success case prop solver time     : 0.000
% 0.19/0.48  # Current number of processed clauses  : 38
% 0.19/0.48  #    Positive orientable unit clauses  : 17
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 1
% 0.19/0.48  #    Non-unit-clauses                  : 20
% 0.19/0.48  # Current number of unprocessed clauses: 43
% 0.19/0.48  # ...number of literals in the above   : 120
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 21
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 101
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 89
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.48  # Unit Clause-clause subsumption calls : 0
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 1
% 0.19/0.48  # BW rewrite match successes           : 0
% 0.19/0.48  # Condensation attempts                : 0
% 0.19/0.48  # Condensation successes               : 0
% 0.19/0.48  # Termbank termtop insertions          : 1497
% 0.19/0.48  # Search garbage collected termcells   : 56
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.004 s
% 0.19/0.48  # System time              : 0.003 s
% 0.19/0.48  # Total time               : 0.008 s
% 0.19/0.48  # Maximum resident set size: 1644 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.021 s
% 0.19/0.48  # System time              : 0.009 s
% 0.19/0.48  # Total time               : 0.030 s
% 0.19/0.48  # Maximum resident set size: 1716 pages
% 0.19/0.48  % E---3.1 exiting
% 0.19/0.48  % E exiting
%------------------------------------------------------------------------------