↑ Up

E---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : HAL007+1 : TPTP v9.3.1. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:45:14 PM UTC 2026

% Result   : Satisfiable 0.18s 1.05s
% Output   : Saturation 0.18s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_13ERROR: Could not build tree for root c_0_28ERROR: MakeTreeStats fails)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HAL007+1 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.98  % Computer : n008.cluster.edu
% 0.11/0.98  % Model    : x86_64 x86_64
% 0.11/0.98  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.98  % Memory   : 8046.5625MB
% 0.11/0.98  % OS       : Linux 6.8.0-71-generic
% 0.11/0.98  % CPULimit : 300
% 0.11/0.98  % WCLimit  : 300
% 0.11/0.98  % DateTime : Sun Sep 20 20:45:41 UTC 2026
% 0.11/0.98  % CPUTime  : 
% 0.11/0.98  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/1.02  Running first-order theorem proving
% 0.11/1.02  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.18/1.05  % Version: 3.5.1
% 0.18/1.05  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/1.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/1.05  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/1.05  % Starting new_bool_3 with 300s (1) cores
% 0.18/1.05  % Starting new_bool_1 with 300s (1) cores
% 0.18/1.05  % Starting sh5l with 300s (1) cores
% 0.18/1.05  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3575741 completed with status 1
% 0.18/1.05  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/1.05  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/1.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/1.05  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/1.05  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/1.05  % No SInE strategy applied
% 0.18/1.05  % Search class: FGUSF-FFMF33-MFFFFFNN
% 0.18/1.05  % partial match(1): FGUSF-FFMM33-MFFFFFNN
% 0.18/1.05  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/1.05  % Starting SubtermCWHack with 136s (1) cores
% 0.18/1.05  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/1.05  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_RG_S2sX with 254s (1) cores
% 0.18/1.05  % Starting new_bool_3 with 254s (1) cores
% 0.18/1.05  % Starting new_bool_1 with 254s (1) cores
% 0.18/1.05  % new_bool_3 with pid 3575760 completed with status 1
% 0.18/1.05  % Result found by new_bool_3
% 0.18/1.05  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/1.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/1.05  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/1.05  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/1.05  % No SInE strategy applied
% 0.18/1.05  % Search class: FGUSF-FFMF33-MFFFFFNN
% 0.18/1.05  % partial match(1): FGUSF-FFMM33-MFFFFFNN
% 0.18/1.05  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/1.05  % Starting SubtermCWHack with 136s (1) cores
% 0.18/1.05  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/1.05  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_RG_S2sX with 254s (1) cores
% 0.18/1.05  % Starting new_bool_3 with 254s (1) cores
% 0.18/1.05  % Preprocessing time       : 0.001 s
% 0.18/1.05  % Presaturation interreduction done
% 0.18/1.05  
% 0.18/1.05  % No proof found!
% 0.18/1.05  % SZS status Satisfiable
% 0.18/1.05  % SZS output start Saturation
% See solution above
% 0.18/1.05  % Parsed axioms                        : 13
% 0.18/1.05  % Removed by relevancy pruning/SinE    : 0
% 0.18/1.05  % Initial clauses                      : 27
% 0.18/1.05  % Removed in clause preprocessing      : 0
% 0.18/1.05  % Initial clauses in saturation        : 27
% 0.18/1.05  % Processed clauses                    : 56
% 0.18/1.05  % ...of these trivial                  : 0
% 0.18/1.05  % ...subsumed                          : 1
% 0.18/1.05  % ...remaining for further processing  : 55
% 0.18/1.05  % Other redundant clauses eliminated   : 2
% 0.18/1.05  % Clauses deleted for lack of memory   : 0
% 0.18/1.05  % Backward-subsumed                    : 0
% 0.18/1.05  % Backward-rewritten                   : 0
% 0.18/1.05  % Generated clauses                    : 4
% 0.18/1.05  % ...of the previous two non-redundant : 3
% 0.18/1.05  % ...aggressively subsumed             : 0
% 0.18/1.05  % Contextual simplify-reflections      : 0
% 0.18/1.05  % Paramodulations                      : 0
% 0.18/1.05  % Factorizations                       : 0
% 0.18/1.05  % NegExts                              : 0
% 0.18/1.05  % Equation resolutions                 : 4
% 0.18/1.05  % Disequality decompositions           : 0
% 0.18/1.05  % Total rewrite steps                  : 0
% 0.18/1.05  % ...of those cached                   : 0
% 0.18/1.05  % Propositional unsat checks           : 0
% 0.18/1.05  %    Propositional check models        : 0
% 0.18/1.05  %    Propositional check unsatisfiable : 0
% 0.18/1.05  %    Propositional clauses             : 0
% 0.18/1.05  %    Propositional clauses after purity: 0
% 0.18/1.05  %    Propositional unsat core size     : 0
% 0.18/1.05  %    Propositional preprocessing time  : 0.000
% 0.18/1.05  %    Propositional encoding time       : 0.000
% 0.18/1.05  %    Propositional solver time         : 0.000
% 0.18/1.05  %    Success case prop preproc time    : 0.000
% 0.18/1.05  %    Success case prop encoding time   : 0.000
% 0.18/1.05  %    Success case prop solver time     : 0.000
% 0.18/1.05  % Current number of processed clauses  : 27
% 0.18/1.05  %    Positive orientable unit clauses  : 0
% 0.18/1.05  %    Positive unorientable unit clauses: 0
% 0.18/1.05  %    Negative unit clauses             : 0
% 0.18/1.05  %    Non-unit-clauses                  : 27
% 0.18/1.05  % Current number of unprocessed clauses: 0
% 0.18/1.05  % ...number of literals in the above   : 0
% 0.18/1.05  % Current number of archived formulas  : 0
% 0.18/1.05  % Current number of archived clauses   : 26
% 0.18/1.05  % Clause-clause subsumption calls (NU) : 175
% 0.18/1.05  % Rec. Clause-clause subsumption calls : 17
% 0.18/1.05  % Non-unit clause-clause subsumptions  : 1
% 0.18/1.05  % Unit Clause-clause subsumption calls : 0
% 0.18/1.05  % Rewrite failures with RHS unbound    : 0
% 0.18/1.05  % BW rewrite match attempts            : 0
% 0.18/1.05  % BW rewrite match successes           : 0
% 0.18/1.05  % Condensation attempts                : 0
% 0.18/1.05  % Condensation successes               : 0
% 0.18/1.05  % Termbank termtop insertions          : 3751
% 0.18/1.05  % Search garbage collected termcells   : 891
% 0.18/1.05  
% 0.18/1.05  % -------------------------------------------------
% 0.18/1.05  % User time                : 0.009 s
% 0.18/1.05  % System time              : 0.003 s
% 0.18/1.05  % Total time               : 0.012 s
% 0.18/1.05  % Maximum resident set size: 3612 pages
% 0.18/1.05  
% 0.18/1.05  % -------------------------------------------------
% 0.18/1.05  % User time                : 0.027 s
% 0.18/1.05  % System time              : 0.010 s
% 0.18/1.05  % Total time               : 0.037 s
% 0.18/1.05  % Maximum resident set size: 4608 pages
% 0.18/1.05  % E exiting
%------------------------------------------------------------------------------