TSTP Solution File: HAL007+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : HAL007+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 17:50:43 EDT 2023

% Result   : Satisfiable 0.15s 0.42s
% Output   : Saturation 0.15s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_13)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_15,plain,
    ( commute(X2,X1,X3,X4)
    | apply(X1,apply(X2,esk8_5(X2,X1,X3,X4,X5))) != apply(X4,apply(X3,esk8_5(X2,X1,X3,X4,X5)))
    | ~ morphism(X2,X5,X6)
    | ~ morphism(X1,X6,X7)
    | ~ morphism(X3,X5,X8)
    | ~ morphism(X4,X8,X7) ),
    inference(split_conjunct,[status(thm)],[c_0_13]),
    [final] ).

cnf(c_0_28,plain,
    ( commute(X1,X2,X1,X2)
    | ~ morphism(X2,X3,X4)
    | ~ morphism(X1,X5,X3)
    | ~ morphism(X1,X5,X6)
    | ~ morphism(X2,X6,X4) ),
    inference(er,[status(thm)],[c_0_15]),
    [final] ).

cnf(c_0_29,plain,
    ( apply(X1,esk7_5(X1,X2,X3,X4,X5)) = esk6_5(X1,X2,X3,X4,X5)
    | apply(X2,esk6_5(X1,X2,X3,X4,X5)) = zero(X5)
    | exact(X1,X2)
    | ~ morphism(X1,X3,X4)
    | ~ morphism(X2,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_16]),
    [final] ).

cnf(c_0_30,plain,
    ( apply(X2,apply(X1,X9)) = apply(X4,apply(X3,X9))
    | ~ commute(X1,X2,X3,X4)
    | ~ morphism(X1,X5,X6)
    | ~ morphism(X2,X6,X7)
    | ~ morphism(X3,X5,X8)
    | ~ morphism(X4,X8,X7)
    | ~ element(X9,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_17]),
    [final] ).

cnf(c_0_31,plain,
    ( exact(X1,X2)
    | ~ element(esk6_5(X1,X2,X3,X4,X5),X4)
    | apply(X2,esk6_5(X1,X2,X3,X4,X5)) != zero(X5)
    | ~ element(X6,X3)
    | apply(X1,X6) != esk6_5(X1,X2,X3,X4,X5)
    | ~ morphism(X1,X3,X4)
    | ~ morphism(X2,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_16]),
    [final] ).

cnf(c_0_32,plain,
    ( apply(X1,esk7_5(X1,X2,X3,X4,X5)) = esk6_5(X1,X2,X3,X4,X5)
    | element(esk6_5(X1,X2,X3,X4,X5),X4)
    | exact(X1,X2)
    | ~ morphism(X1,X3,X4)
    | ~ morphism(X2,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_16]),
    [final] ).

cnf(c_0_33,plain,
    ( element(esk8_5(X1,X2,X3,X4,X5),X5)
    | commute(X1,X2,X3,X4)
    | ~ morphism(X1,X5,X6)
    | ~ morphism(X2,X6,X7)
    | ~ morphism(X3,X5,X8)
    | ~ morphism(X4,X8,X7) ),
    inference(split_conjunct,[status(thm)],[c_0_13]),
    [final] ).

cnf(c_0_34,plain,
    ( element(esk7_5(X1,X2,X3,X4,X5),X3)
    | apply(X2,esk6_5(X1,X2,X3,X4,X5)) = zero(X5)
    | exact(X1,X2)
    | ~ morphism(X1,X3,X4)
    | ~ morphism(X2,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_16]),
    [final] ).

cnf(c_0_35,plain,
    ( element(esk7_5(X1,X2,X3,X4,X5),X3)
    | element(esk6_5(X1,X2,X3,X4,X5),X4)
    | exact(X1,X2)
    | ~ morphism(X1,X3,X4)
    | ~ morphism(X2,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_16]),
    [final] ).

cnf(c_0_36,plain,
    ( apply(X1,esk5_6(X1,X2,X3,X4,X5,X6)) = X6
    | ~ element(X6,X4)
    | apply(X2,X6) != zero(X5)
    | ~ exact(X1,X2)
    | ~ morphism(X1,X3,X4)
    | ~ morphism(X2,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_14]),
    [final] ).

cnf(c_0_37,plain,
    ( element(esk5_6(X1,X2,X3,X4,X5,X6),X3)
    | ~ element(X6,X4)
    | apply(X2,X6) != zero(X5)
    | ~ exact(X1,X2)
    | ~ morphism(X1,X3,X4)
    | ~ morphism(X2,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_14]),
    [final] ).

cnf(c_0_38,plain,
    ( apply(X1,subtract(X2,X4,X5)) = subtract(X3,apply(X1,X4),apply(X1,X5))
    | ~ morphism(X1,X2,X3)
    | ~ element(X4,X2)
    | ~ element(X5,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]),
    [final] ).

cnf(c_0_39,plain,
    ( apply(X1,apply(X2,X3)) = zero(X4)
    | ~ exact(X2,X1)
    | ~ element(X3,X5)
    | ~ morphism(X2,X5,X6)
    | ~ morphism(X1,X6,X4) ),
    inference(er,[status(thm)],[c_0_19]),
    [final] ).

cnf(c_0_40,plain,
    ( apply(X1,esk3_4(X1,X2,X3,X4)) = X4
    | ~ element(X4,X3)
    | ~ surjection(X1)
    | ~ morphism(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_20]),
    [final] ).

cnf(c_0_41,plain,
    ( X4 = X5
    | ~ injection(X1)
    | ~ morphism(X1,X2,X3)
    | ~ element(X4,X2)
    | ~ element(X5,X2)
    | apply(X1,X4) != apply(X1,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_21]),
    [final] ).

cnf(c_0_42,plain,
    ( element(esk3_4(X1,X2,X3,X4),X2)
    | ~ element(X4,X3)
    | ~ surjection(X1)
    | ~ morphism(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_20]),
    [final] ).

cnf(c_0_43,plain,
    ( apply(X1,esk1_2(X1,X2)) = apply(X1,esk2_2(X1,X2))
    | injection(X1)
    | ~ morphism(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]),
    [final] ).

cnf(c_0_44,plain,
    ( element(apply(X3,X1),X4)
    | ~ element(X1,X2)
    | ~ morphism(X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_23]),
    [final] ).

cnf(c_0_45,plain,
    ( subtract(X2,X1,subtract(X2,X1,X3)) = X3
    | ~ element(X1,X2)
    | ~ element(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]),
    [final] ).

cnf(c_0_46,plain,
    ( element(esk2_2(X1,X2),X2)
    | injection(X1)
    | ~ morphism(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]),
    [final] ).

cnf(c_0_47,plain,
    ( element(esk1_2(X1,X2),X2)
    | injection(X1)
    | ~ morphism(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]),
    [final] ).

cnf(c_0_48,plain,
    ( element(esk4_3(X1,X2,X3),X3)
    | surjection(X1)
    | ~ morphism(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_25]),
    [final] ).

cnf(c_0_49,plain,
    ( apply(X1,zero(X2)) = zero(X3)
    | ~ morphism(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_23]),
    [final] ).

cnf(c_0_50,plain,
    ( element(subtract(X2,X1,X3),X2)
    | ~ element(X1,X2)
    | ~ element(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_26]),
    [final] ).

cnf(c_0_51,plain,
    ( surjection(X3)
    | ~ element(X1,X2)
    | apply(X3,X1) != esk4_3(X3,X2,X4)
    | ~ morphism(X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_25]),
    [final] ).

cnf(c_0_52,plain,
    ( subtract(X2,X1,X1) = zero(X2)
    | ~ element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_27]),
    [final] ).

cnf(c_0_53,plain,
    ( injection(X1)
    | esk1_2(X1,X2) != esk2_2(X1,X2)
    | ~ morphism(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : HAL007+1 : TPTP v8.1.2. Released v6.4.0.
% 0.02/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n010.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon Oct  2 23:32:20 EDT 2023
% 0.10/0.30  % CPUTime    : 
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.8jZRapm5gf/E---3.1_27226.p
% 0.15/0.42  # Version: 3.1pre001
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27304 completed with status 1
% 0.15/0.42  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # No SInE strategy applied
% 0.15/0.42  # Search class: FGUSF-FFMF33-MFFFFFNN
% 0.15/0.42  # partial match(1): FGUSF-FFMM33-MFFFFFNN
% 0.15/0.42  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 338s (1) cores
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.42  # Starting new_bool_3 with 254s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 254s (1) cores
% 0.15/0.42  # Starting sh5l with 254s (1) cores
% 0.15/0.42  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with pid 27323 completed with status 1
% 0.15/0.42  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # No SInE strategy applied
% 0.15/0.42  # Search class: FGUSF-FFMF33-MFFFFFNN
% 0.15/0.42  # partial match(1): FGUSF-FFMM33-MFFFFFNN
% 0.15/0.42  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 338s (1) cores
% 0.15/0.42  # Preprocessing time       : 0.001 s
% 0.15/0.42  # Presaturation interreduction done
% 0.15/0.42  
% 0.15/0.42  # No proof found!
% 0.15/0.42  # SZS status Satisfiable
% 0.15/0.42  # SZS output start Saturation
% See solution above
% 0.15/0.42  # Parsed axioms                        : 13
% 0.15/0.42  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.42  # Initial clauses                      : 27
% 0.15/0.42  # Removed in clause preprocessing      : 0
% 0.15/0.42  # Initial clauses in saturation        : 27
% 0.15/0.42  # Processed clauses                    : 56
% 0.15/0.42  # ...of these trivial                  : 0
% 0.15/0.42  # ...subsumed                          : 1
% 0.15/0.42  # ...remaining for further processing  : 55
% 0.15/0.42  # Other redundant clauses eliminated   : 2
% 0.15/0.42  # Clauses deleted for lack of memory   : 0
% 0.15/0.42  # Backward-subsumed                    : 0
% 0.15/0.42  # Backward-rewritten                   : 0
% 0.15/0.42  # Generated clauses                    : 4
% 0.15/0.42  # ...of the previous two non-redundant : 3
% 0.15/0.42  # ...aggressively subsumed             : 0
% 0.15/0.42  # Contextual simplify-reflections      : 0
% 0.15/0.42  # Paramodulations                      : 0
% 0.15/0.42  # Factorizations                       : 0
% 0.15/0.42  # NegExts                              : 0
% 0.15/0.42  # Equation resolutions                 : 4
% 0.15/0.42  # Total rewrite steps                  : 0
% 0.15/0.42  # Propositional unsat checks           : 0
% 0.15/0.42  #    Propositional check models        : 0
% 0.15/0.42  #    Propositional check unsatisfiable : 0
% 0.15/0.42  #    Propositional clauses             : 0
% 0.15/0.42  #    Propositional clauses after purity: 0
% 0.15/0.42  #    Propositional unsat core size     : 0
% 0.15/0.42  #    Propositional preprocessing time  : 0.000
% 0.15/0.42  #    Propositional encoding time       : 0.000
% 0.15/0.42  #    Propositional solver time         : 0.000
% 0.15/0.42  #    Success case prop preproc time    : 0.000
% 0.15/0.42  #    Success case prop encoding time   : 0.000
% 0.15/0.42  #    Success case prop solver time     : 0.000
% 0.15/0.42  # Current number of processed clauses  : 27
% 0.15/0.42  #    Positive orientable unit clauses  : 0
% 0.15/0.42  #    Positive unorientable unit clauses: 0
% 0.15/0.42  #    Negative unit clauses             : 0
% 0.15/0.42  #    Non-unit-clauses                  : 27
% 0.15/0.42  # Current number of unprocessed clauses: 0
% 0.15/0.42  # ...number of literals in the above   : 0
% 0.15/0.42  # Current number of archived formulas  : 0
% 0.15/0.42  # Current number of archived clauses   : 26
% 0.15/0.42  # Clause-clause subsumption calls (NU) : 223
% 0.15/0.42  # Rec. Clause-clause subsumption calls : 24
% 0.15/0.42  # Non-unit clause-clause subsumptions  : 1
% 0.15/0.42  # Unit Clause-clause subsumption calls : 0
% 0.15/0.42  # Rewrite failures with RHS unbound    : 0
% 0.15/0.42  # BW rewrite match attempts            : 0
% 0.15/0.42  # BW rewrite match successes           : 0
% 0.15/0.42  # Condensation attempts                : 0
% 0.15/0.42  # Condensation successes               : 0
% 0.15/0.42  # Termbank termtop insertions          : 3188
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.010 s
% 0.15/0.42  # System time              : 0.002 s
% 0.15/0.42  # Total time               : 0.012 s
% 0.15/0.42  # Maximum resident set size: 1896 pages
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.034 s
% 0.15/0.42  # System time              : 0.003 s
% 0.15/0.42  # Total time               : 0.038 s
% 0.15/0.42  # Maximum resident set size: 1708 pages
% 0.15/0.42  % E---3.1 exiting
% 0.15/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------