TSTP Solution File: ALG245-1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n015.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:12:54 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c02,axiom,
    mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).

cnf(c03,axiom,
    mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).

cnf(c01,axiom,
    mult(X1,mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).

cnf(c05,axiom,
    mult(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).

cnf(c04,axiom,
    mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(X1,X2),mult(X3,X4)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).

cnf(goals,negated_conjecture,
    mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(c_0_6,axiom,
    mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,X3)),
    c02 ).

cnf(c_0_7,axiom,
    mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
    c03 ).

cnf(c_0_8,axiom,
    mult(X1,mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
    c01 ).

cnf(c_0_9,axiom,
    mult(X1,X1) = X1,
    c05 ).

cnf(c_0_10,plain,
    mult(mult(mult(X1,X2),mult(X3,X4)),mult(X5,mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4))))) = mult(mult(mult(X1,X3),mult(X2,X4)),mult(X5,mult(mult(X1,X2),mult(X3,X4)))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

cnf(c_0_11,axiom,
    mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(X1,X2),mult(X3,X4)),
    c04 ).

cnf(c_0_12,negated_conjecture,
    mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
    inference(fof_simplification,[status(thm)],[goals]) ).

cnf(c_0_13,plain,
    mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]),c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
    c_0_12 ).

cnf(c_0_16,plain,
    mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ALG245-1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 23:00:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.22/0.48  Running first-order model finding
% 0.22/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
% 1.69/0.69  # Version: 3.1.0
% 1.69/0.69  # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.69/0.69  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.69  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.69/0.69  # Starting new_bool_3 with 300s (1) cores
% 1.69/0.69  # Starting new_bool_1 with 300s (1) cores
% 1.69/0.69  # Starting sh5l with 300s (1) cores
% 1.69/0.69  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7110 completed with status 0
% 1.69/0.69  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.69/0.69  # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.69/0.69  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.69  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.69/0.69  # No SInE strategy applied
% 1.69/0.69  # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.69/0.69  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.69  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 1.69/0.69  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.69/0.69  # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.69/0.69  # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.69/0.69  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 1.69/0.69  # U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 7118 completed with status 0
% 1.69/0.69  # Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.69/0.69  # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.69/0.69  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.69  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.69/0.69  # No SInE strategy applied
% 1.69/0.69  # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.69/0.69  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.69  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 1.69/0.69  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.69/0.69  # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.69/0.69  # Preprocessing time       : 0.001 s
% 1.69/0.69  # Presaturation interreduction done
% 1.69/0.69  
% 1.69/0.69  # Proof found!
% 1.69/0.69  # SZS status Unsatisfiable
% 1.69/0.69  # SZS output start CNFRefutation
% See solution above
% 1.69/0.69  # Parsed axioms                        : 6
% 1.69/0.69  # Removed by relevancy pruning/SinE    : 0
% 1.69/0.69  # Initial clauses                      : 6
% 1.69/0.69  # Removed in clause preprocessing      : 0
% 1.69/0.69  # Initial clauses in saturation        : 6
% 1.69/0.69  # Processed clauses                    : 67
% 1.69/0.69  # ...of these trivial                  : 4
% 1.69/0.69  # ...subsumed                          : 8
% 1.69/0.69  # ...remaining for further processing  : 55
% 1.69/0.69  # Other redundant clauses eliminated   : 0
% 1.69/0.69  # Clauses deleted for lack of memory   : 0
% 1.69/0.69  # Backward-subsumed                    : 0
% 1.69/0.69  # Backward-rewritten                   : 5
% 1.69/0.69  # Generated clauses                    : 9499
% 1.69/0.69  # ...of the previous two non-redundant : 7329
% 1.69/0.69  # ...aggressively subsumed             : 0
% 1.69/0.69  # Contextual simplify-reflections      : 0
% 1.69/0.69  # Paramodulations                      : 9499
% 1.69/0.69  # Factorizations                       : 0
% 1.69/0.69  # NegExts                              : 0
% 1.69/0.69  # Equation resolutions                 : 0
% 1.69/0.69  # Disequality decompositions           : 0
% 1.69/0.69  # Total rewrite steps                  : 14505
% 1.69/0.69  # ...of those cached                   : 12108
% 1.69/0.69  # Propositional unsat checks           : 0
% 1.69/0.69  #    Propositional check models        : 0
% 1.69/0.69  #    Propositional check unsatisfiable : 0
% 1.69/0.69  #    Propositional clauses             : 0
% 1.69/0.69  #    Propositional clauses after purity: 0
% 1.69/0.69  #    Propositional unsat core size     : 0
% 1.69/0.69  #    Propositional preprocessing time  : 0.000
% 1.69/0.69  #    Propositional encoding time       : 0.000
% 1.69/0.69  #    Propositional solver time         : 0.000
% 1.69/0.69  #    Success case prop preproc time    : 0.000
% 1.69/0.69  #    Success case prop encoding time   : 0.000
% 1.69/0.69  #    Success case prop solver time     : 0.000
% 1.69/0.69  # Current number of processed clauses  : 44
% 1.69/0.69  #    Positive orientable unit clauses  : 39
% 1.69/0.69  #    Positive unorientable unit clauses: 5
% 1.69/0.69  #    Negative unit clauses             : 0
% 1.69/0.69  #    Non-unit-clauses                  : 0
% 1.69/0.69  # Current number of unprocessed clauses: 7273
% 1.69/0.69  # ...number of literals in the above   : 7273
% 1.69/0.69  # Current number of archived formulas  : 0
% 1.69/0.69  # Current number of archived clauses   : 11
% 1.69/0.69  # Clause-clause subsumption calls (NU) : 0
% 1.69/0.69  # Rec. Clause-clause subsumption calls : 0
% 1.69/0.69  # Non-unit clause-clause subsumptions  : 0
% 1.69/0.69  # Unit Clause-clause subsumption calls : 80
% 1.69/0.69  # Rewrite failures with RHS unbound    : 0
% 1.69/0.69  # BW rewrite match attempts            : 472
% 1.69/0.69  # BW rewrite match successes           : 13
% 1.69/0.69  # Condensation attempts                : 0
% 1.69/0.69  # Condensation successes               : 0
% 1.69/0.69  # Termbank termtop insertions          : 247752
% 1.69/0.69  # Search garbage collected termcells   : 2
% 1.69/0.69  
% 1.69/0.69  # -------------------------------------------------
% 1.69/0.69  # User time                : 0.186 s
% 1.69/0.69  # System time              : 0.011 s
% 1.69/0.69  # Total time               : 0.197 s
% 1.69/0.69  # Maximum resident set size: 1544 pages
% 1.69/0.69  
% 1.69/0.69  # -------------------------------------------------
% 1.69/0.69  # User time                : 0.930 s
% 1.69/0.69  # System time              : 0.045 s
% 1.69/0.69  # Total time               : 0.975 s
% 1.69/0.69  # Maximum resident set size: 1684 pages
% 1.69/0.69  % E---3.1 exiting
%------------------------------------------------------------------------------