↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GRP780+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n018.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  : 600s
% DateTime : Sat Jul 16 09:03:39 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   55 (  51 unt;   0 def)
%            Number of atoms       :   61 (  44 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   18 (  12   ~;   4   |;   1   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   9 con; 0-3 aty)
%            Number of variables   :   74 (   3 sgn  33   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sos08,axiom,
    ! [X5,X6,X7] :
      ( d(X5,X6,X7)
    <=> product(X5,X6) = product(X6,X7) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos08) ).

fof(sos05,axiom,
    ! [X3,X4,X1,X2] : product(product(X2,X1),product(X4,X3)) = product(product(X2,X4),product(X1,X3)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos05) ).

fof(sos06,axiom,
    ! [X2] : product(X2,X2) = X2,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos06) ).

fof(sos12,axiom,
    d(c1,c2,c3),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos12) ).

fof(goals,conjecture,
    d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).

fof(sos07,axiom,
    ! [X1,X2] : product(product(product(X2,X1),X1),product(X1,product(X1,X2))) = X1,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos07) ).

fof(sos09,axiom,
    ! [X4,X1,X2] : bigC(X2,X1,X4) = product(product(X2,X1),product(X4,X2)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos09) ).

fof(sos01,axiom,
    ! [X1,X2] : difference(X2,product(X2,X1)) = X1,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos01) ).

fof(sos11,axiom,
    d(b1,b2,b3),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos11) ).

fof(sos10,axiom,
    d(a1,a2,a3),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos10) ).

fof(c_0_10,plain,
    ! [X8,X9,X10,X8,X9,X10] :
      ( ( ~ d(X8,X9,X10)
        | product(X8,X9) = product(X9,X10) )
      & ( product(X8,X9) != product(X9,X10)
        | d(X8,X9,X10) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos08])])])]) ).

fof(c_0_11,plain,
    ! [X5,X6,X7,X8] : product(product(X8,X7),product(X6,X5)) = product(product(X8,X6),product(X7,X5)),
    inference(variable_rename,[status(thm)],[sos05]) ).

fof(c_0_12,plain,
    ! [X3] : product(X3,X3) = X3,
    inference(variable_rename,[status(thm)],[sos06]) ).

cnf(c_0_13,plain,
    ( product(X1,X2) = product(X2,X3)
    | ~ d(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    d(c1,c2,c3),
    inference(split_conjunct,[status(thm)],[sos12]) ).

fof(c_0_15,negated_conjecture,
    ~ d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_16,plain,
    ! [X3,X4] : product(product(product(X4,X3),X3),product(X3,product(X3,X4))) = X3,
    inference(variable_rename,[status(thm)],[sos07]) ).

cnf(c_0_17,plain,
    product(product(X1,X2),product(X3,X4)) = product(product(X1,X3),product(X2,X4)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    product(X1,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    product(c2,c3) = product(c1,c2),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

fof(c_0_20,negated_conjecture,
    ~ d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

fof(c_0_21,plain,
    ! [X5,X6,X7] : bigC(X7,X6,X5) = product(product(X7,X6),product(X5,X7)),
    inference(variable_rename,[status(thm)],[sos09]) ).

cnf(c_0_22,plain,
    product(product(product(X1,X2),X2),product(X2,product(X2,X1))) = X2,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,plain,
    product(product(product(X1,X2),X3),product(product(X4,X5),X6)) = product(product(product(X1,X4),product(X2,X5)),product(X3,X6)),
    inference(spm,[status(thm)],[c_0_17,c_0_17]) ).

cnf(c_0_24,plain,
    product(product(X1,X2),product(X1,X3)) = product(X1,product(X2,X3)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,plain,
    product(product(X1,c2),product(X2,c3)) = product(product(X1,X2),product(c1,c2)),
    inference(spm,[status(thm)],[c_0_17,c_0_19]) ).

fof(c_0_26,plain,
    ! [X3,X4] : difference(X4,product(X4,X3)) = X3,
    inference(variable_rename,[status(thm)],[sos01]) ).

cnf(c_0_27,plain,
    d(b1,b2,b3),
    inference(split_conjunct,[status(thm)],[sos11]) ).

cnf(c_0_28,negated_conjecture,
    ~ d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_29,plain,
    bigC(X1,X2,X3) = product(product(X1,X2),product(X3,X1)),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_30,plain,
    product(product(product(X1,X2),product(X2,X3)),product(product(X2,X3),product(X3,X1))) = product(X2,X3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]),c_0_24]) ).

cnf(c_0_31,plain,
    product(product(c1,c2),product(X1,c3)) = product(c1,product(X1,c2)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,plain,
    difference(X1,product(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_33,plain,
    product(b2,b3) = product(b1,b2),
    inference(spm,[status(thm)],[c_0_13,c_0_27]) ).

cnf(c_0_34,negated_conjecture,
    ~ d(product(product(a1,b3),product(c2,a1)),product(product(a2,b1),product(c3,a2)),product(product(a3,b2),product(c1,a3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_29]),c_0_29]) ).

cnf(c_0_35,plain,
    ( d(X1,X2,X3)
    | product(X1,X2) != product(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_36,plain,
    d(a1,a2,a3),
    inference(split_conjunct,[status(thm)],[sos10]) ).

cnf(c_0_37,plain,
    product(product(c1,c2),product(product(c1,c2),product(c3,c1))) = product(c1,c2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_18]),c_0_19]),c_0_19]) ).

cnf(c_0_38,plain,
    difference(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_32,c_0_18]) ).

cnf(c_0_39,plain,
    product(product(X1,b2),product(X2,b3)) = product(product(X1,X2),product(b1,b2)),
    inference(spm,[status(thm)],[c_0_17,c_0_33]) ).

cnf(c_0_40,negated_conjecture,
    product(product(product(a2,a3),product(b1,b2)),product(product(c3,a2),product(c1,a3))) != product(product(product(a1,a2),product(b3,b1)),product(product(c2,a1),product(c3,a2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).

cnf(c_0_41,plain,
    product(a2,a3) = product(a1,a2),
    inference(spm,[status(thm)],[c_0_13,c_0_36]) ).

cnf(c_0_42,plain,
    product(product(c1,c2),product(c3,c1)) = product(c1,c2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_38]) ).

cnf(c_0_43,plain,
    product(product(b1,b2),product(X1,b3)) = product(b1,product(X1,b2)),
    inference(spm,[status(thm)],[c_0_24,c_0_39]) ).

cnf(c_0_44,negated_conjecture,
    product(product(product(a1,a2),product(b3,b1)),product(product(c2,a1),product(c3,a2))) != product(product(product(a1,a2),product(b1,b2)),product(product(c3,a2),product(c1,a3))),
    inference(rw,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    product(product(c2,X1),product(c3,X2)) = product(product(c1,c2),product(X1,X2)),
    inference(spm,[status(thm)],[c_0_17,c_0_19]) ).

cnf(c_0_46,plain,
    product(product(X1,a2),product(X2,a3)) = product(product(X1,X2),product(a1,a2)),
    inference(spm,[status(thm)],[c_0_17,c_0_41]) ).

cnf(c_0_47,plain,
    product(c3,c1) = product(c1,c2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_42]),c_0_38]) ).

cnf(c_0_48,plain,
    product(product(b1,b2),product(product(b1,b2),product(b3,b1))) = product(b1,b2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_43]),c_0_18]),c_0_33]),c_0_33]) ).

cnf(c_0_49,negated_conjecture,
    product(product(product(a1,a2),product(b3,b1)),product(product(c1,a1),product(c2,a2))) != product(product(product(a1,a2),product(b1,b2)),product(product(c3,a2),product(c1,a3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_17]) ).

cnf(c_0_50,plain,
    product(product(c3,a2),product(c1,a3)) = product(product(c1,a1),product(c2,a2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_17]) ).

cnf(c_0_51,plain,
    product(product(b1,b2),product(b3,b1)) = product(b1,b2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_48]),c_0_38]) ).

cnf(c_0_52,negated_conjecture,
    product(product(product(a1,a2),product(b3,b1)),product(product(c1,a1),product(c2,a2))) != product(product(product(a1,a2),product(b1,b2)),product(product(c1,a1),product(c2,a2))),
    inference(rw,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_53,plain,
    product(b3,b1) = product(b1,b2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_51]),c_0_38]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP780+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n018.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  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 14:53:12 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.41  # Preprocessing time       : 0.014 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 55
% 0.23/1.41  # Proof object clause steps            : 37
% 0.23/1.41  # Proof object formula steps           : 18
% 0.23/1.41  # Proof object conjectures             : 10
% 0.23/1.41  # Proof object clause conjectures      : 7
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 11
% 0.23/1.41  # Proof object initial formulas used   : 10
% 0.23/1.41  # Proof object generating inferences   : 21
% 0.23/1.41  # Proof object simplifying inferences  : 26
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 13
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.41  # Initial clauses                      : 14
% 0.23/1.41  # Removed in clause preprocessing      : 1
% 0.23/1.41  # Initial clauses in saturation        : 13
% 0.23/1.41  # Processed clauses                    : 270
% 0.23/1.41  # ...of these trivial                  : 47
% 0.23/1.41  # ...subsumed                          : 15
% 0.23/1.41  # ...remaining for further processing  : 208
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 84
% 0.23/1.41  # Generated clauses                    : 12868
% 0.23/1.41  # ...of the previous two non-trivial   : 12047
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 12868
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 124
% 0.23/1.41  #    Positive orientable unit clauses  : 108
% 0.23/1.41  #    Positive unorientable unit clauses: 13
% 0.23/1.41  #    Negative unit clauses             : 1
% 0.23/1.41  #    Non-unit-clauses                  : 2
% 0.23/1.41  # Current number of unprocessed clauses: 8781
% 0.23/1.41  # ...number of literals in the above   : 8781
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 85
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.41  # Unit Clause-clause subsumption calls : 66
% 0.23/1.41  # Rewrite failures with RHS unbound    : 997
% 0.23/1.41  # BW rewrite match attempts            : 586
% 0.23/1.41  # BW rewrite match successes           : 331
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 251683
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.155 s
% 0.23/1.41  # System time              : 0.014 s
% 0.23/1.41  # Total time               : 0.169 s
% 0.23/1.41  # Maximum resident set size: 13600 pages
% 0.23/23.40  eprover: CPU time limit exceeded, terminating
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42  eprover: No such file or directory
% 0.23/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------