TSTP Solution File: GRP660-11 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP660-11 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n001.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 : Thu Aug 31 01:19:31 EDT 2023
% Result : Unsatisfiable 0.19s 0.43s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP660-11 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.34 % Computer : n001.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 : Tue Aug 29 00:16:51 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.43 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.19/0.43
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43
% 0.19/0.46 % SZS output start Proof
% 0.19/0.46 Axiom 1 (f01): mult(X, ld(X, Y)) = Y.
% 0.19/0.46 Axiom 2 (f03): mult(rd(X, Y), Y) = X.
% 0.19/0.46 Axiom 3 (f04): rd(mult(X, Y), Y) = X.
% 0.19/0.46 Axiom 4 (f02): ld(X, mult(X, Y)) = Y.
% 0.19/0.46 Axiom 5 (f05): mult(mult(mult(X, Y), Z), X) = mult(X, mult(Y, mult(Z, X))).
% 0.19/0.46
% 0.19/0.46 Lemma 6: ld(rd(X, Y), X) = Y.
% 0.19/0.46 Proof:
% 0.19/0.46 ld(rd(X, Y), X)
% 0.19/0.46 = { by axiom 2 (f03) R->L }
% 0.19/0.46 ld(rd(X, Y), mult(rd(X, Y), Y))
% 0.19/0.46 = { by axiom 4 (f02) }
% 0.19/0.46 Y
% 0.19/0.46
% 0.19/0.46 Lemma 7: rd(mult(X, mult(Y, mult(Z, X))), X) = mult(mult(X, Y), Z).
% 0.19/0.46 Proof:
% 0.19/0.46 rd(mult(X, mult(Y, mult(Z, X))), X)
% 0.19/0.46 = { by axiom 5 (f05) R->L }
% 0.19/0.46 rd(mult(mult(mult(X, Y), Z), X), X)
% 0.19/0.46 = { by axiom 3 (f04) }
% 0.19/0.46 mult(mult(X, Y), Z)
% 0.19/0.46
% 0.19/0.46 Lemma 8: mult(mult(X, rd(Y, mult(Z, X))), Z) = rd(mult(X, Y), X).
% 0.19/0.46 Proof:
% 0.19/0.46 mult(mult(X, rd(Y, mult(Z, X))), Z)
% 0.19/0.46 = { by lemma 7 R->L }
% 0.19/0.46 rd(mult(X, mult(rd(Y, mult(Z, X)), mult(Z, X))), X)
% 0.19/0.46 = { by axiom 2 (f03) }
% 0.19/0.46 rd(mult(X, Y), X)
% 0.19/0.46
% 0.19/0.46 Lemma 9: rd(mult(X, mult(Y, Z)), X) = mult(mult(X, Y), rd(Z, X)).
% 0.19/0.46 Proof:
% 0.19/0.46 rd(mult(X, mult(Y, Z)), X)
% 0.19/0.46 = { by axiom 2 (f03) R->L }
% 0.19/0.46 rd(mult(X, mult(Y, mult(rd(Z, X), X))), X)
% 0.19/0.46 = { by lemma 7 }
% 0.19/0.46 mult(mult(X, Y), rd(Z, X))
% 0.19/0.46
% 0.19/0.46 Lemma 10: mult(mult(X, rd(Y, Z)), rd(Z, X)) = rd(mult(X, Y), X).
% 0.19/0.46 Proof:
% 0.19/0.46 mult(mult(X, rd(Y, Z)), rd(Z, X))
% 0.19/0.46 = { by lemma 9 R->L }
% 0.19/0.46 rd(mult(X, mult(rd(Y, Z), Z)), X)
% 0.19/0.46 = { by axiom 2 (f03) }
% 0.19/0.46 rd(mult(X, Y), X)
% 0.19/0.46
% 0.19/0.46 Lemma 11: mult(mult(X, rd(X, Y)), rd(Y, X)) = X.
% 0.19/0.46 Proof:
% 0.19/0.46 mult(mult(X, rd(X, Y)), rd(Y, X))
% 0.19/0.46 = { by lemma 10 }
% 0.19/0.46 rd(mult(X, X), X)
% 0.19/0.46 = { by axiom 3 (f04) }
% 0.19/0.46 X
% 0.19/0.46
% 0.19/0.46 Lemma 12: mult(X, rd(X, X)) = X.
% 0.19/0.46 Proof:
% 0.19/0.46 mult(X, rd(X, X))
% 0.19/0.46 = { by lemma 6 R->L }
% 0.19/0.46 ld(rd(rd(X, X), mult(X, rd(X, X))), rd(X, X))
% 0.19/0.46 = { by axiom 3 (f04) R->L }
% 0.19/0.46 ld(rd(rd(mult(rd(X, X), rd(X, X)), rd(X, X)), mult(X, rd(X, X))), rd(X, X))
% 0.19/0.46 = { by lemma 8 R->L }
% 0.19/0.46 ld(rd(mult(mult(rd(X, X), rd(rd(X, X), mult(mult(X, rd(X, X)), rd(X, X)))), mult(X, rd(X, X))), mult(X, rd(X, X))), rd(X, X))
% 0.19/0.46 = { by axiom 3 (f04) }
% 0.19/0.46 ld(mult(rd(X, X), rd(rd(X, X), mult(mult(X, rd(X, X)), rd(X, X)))), rd(X, X))
% 0.19/0.46 = { by lemma 11 }
% 0.19/0.46 ld(mult(rd(X, X), rd(rd(X, X), X)), rd(X, X))
% 0.19/0.46 = { by axiom 1 (f01) R->L }
% 0.19/0.46 ld(mult(mult(X, ld(X, rd(X, X))), rd(rd(X, X), X)), rd(X, X))
% 0.19/0.46 = { by lemma 9 R->L }
% 0.19/0.46 ld(rd(mult(X, mult(ld(X, rd(X, X)), rd(X, X))), X), rd(X, X))
% 0.19/0.46 = { by axiom 4 (f02) R->L }
% 0.19/0.46 ld(rd(ld(rd(X, X), mult(rd(X, X), mult(X, mult(ld(X, rd(X, X)), rd(X, X))))), X), rd(X, X))
% 0.19/0.46 = { by axiom 5 (f05) R->L }
% 0.19/0.46 ld(rd(ld(rd(X, X), mult(mult(mult(rd(X, X), X), ld(X, rd(X, X))), rd(X, X))), X), rd(X, X))
% 0.19/0.46 = { by axiom 2 (f03) }
% 0.19/0.46 ld(rd(ld(rd(X, X), mult(mult(X, ld(X, rd(X, X))), rd(X, X))), X), rd(X, X))
% 0.19/0.46 = { by axiom 1 (f01) }
% 0.19/0.46 ld(rd(ld(rd(X, X), mult(rd(X, X), rd(X, X))), X), rd(X, X))
% 0.19/0.46 = { by axiom 4 (f02) }
% 0.19/0.46 ld(rd(rd(X, X), X), rd(X, X))
% 0.19/0.46 = { by lemma 6 }
% 0.19/0.46 X
% 0.19/0.46
% 0.19/0.46 Lemma 13: rd(X, rd(Y, X)) = mult(X, rd(X, Y)).
% 0.19/0.46 Proof:
% 0.19/0.46 rd(X, rd(Y, X))
% 0.19/0.46 = { by lemma 11 R->L }
% 0.19/0.46 rd(mult(mult(X, rd(X, Y)), rd(Y, X)), rd(Y, X))
% 0.19/0.46 = { by axiom 3 (f04) }
% 0.19/0.46 mult(X, rd(X, Y))
% 0.19/0.46
% 0.19/0.46 Lemma 14: mult(X, mult(ld(X, Y), mult(Z, X))) = mult(mult(Y, Z), X).
% 0.19/0.46 Proof:
% 0.19/0.46 mult(X, mult(ld(X, Y), mult(Z, X)))
% 0.19/0.46 = { by axiom 5 (f05) R->L }
% 0.19/0.46 mult(mult(mult(X, ld(X, Y)), Z), X)
% 0.19/0.46 = { by axiom 1 (f01) }
% 0.19/0.47 mult(mult(Y, Z), X)
% 0.19/0.47
% 0.19/0.47 Lemma 15: ld(rd(X, X), rd(X, X)) = rd(X, X).
% 0.19/0.47 Proof:
% 0.19/0.47 ld(rd(X, X), rd(X, X))
% 0.19/0.47 = { by axiom 3 (f04) R->L }
% 0.19/0.47 rd(mult(ld(rd(X, X), rd(X, X)), mult(X, rd(X, X))), mult(X, rd(X, X)))
% 0.19/0.47 = { by axiom 4 (f02) R->L }
% 0.19/0.47 rd(ld(rd(X, X), mult(rd(X, X), mult(ld(rd(X, X), rd(X, X)), mult(X, rd(X, X))))), mult(X, rd(X, X)))
% 0.19/0.47 = { by lemma 14 }
% 0.19/0.47 rd(ld(rd(X, X), mult(mult(rd(X, X), X), rd(X, X))), mult(X, rd(X, X)))
% 0.19/0.47 = { by axiom 2 (f03) }
% 0.19/0.47 rd(ld(rd(X, X), mult(X, rd(X, X))), mult(X, rd(X, X)))
% 0.19/0.47 = { by lemma 12 }
% 0.19/0.47 rd(ld(rd(X, X), X), mult(X, rd(X, X)))
% 0.19/0.47 = { by lemma 6 }
% 0.19/0.47 rd(X, mult(X, rd(X, X)))
% 0.19/0.47 = { by lemma 12 }
% 0.19/0.47 rd(X, X)
% 0.19/0.47
% 0.19/0.47 Lemma 16: rd(mult(rd(X, X), Y), rd(X, X)) = mult(rd(X, X), mult(rd(X, X), Y)).
% 0.19/0.47 Proof:
% 0.19/0.47 rd(mult(rd(X, X), Y), rd(X, X))
% 0.19/0.47 = { by lemma 8 R->L }
% 0.19/0.47 mult(mult(rd(X, X), rd(Y, mult(rd(X, X), rd(X, X)))), rd(X, X))
% 0.19/0.47 = { by axiom 3 (f04) R->L }
% 0.19/0.47 mult(mult(rd(X, X), rd(Y, rd(mult(mult(rd(X, X), rd(X, X)), mult(X, rd(X, X))), mult(X, rd(X, X))))), rd(X, X))
% 0.19/0.47 = { by lemma 13 R->L }
% 0.19/0.47 mult(mult(rd(X, X), rd(Y, rd(mult(mult(rd(X, X), rd(X, X)), rd(X, rd(X, X))), mult(X, rd(X, X))))), rd(X, X))
% 0.19/0.47 = { by lemma 10 }
% 0.19/0.47 mult(mult(rd(X, X), rd(Y, rd(rd(mult(rd(X, X), X), rd(X, X)), mult(X, rd(X, X))))), rd(X, X))
% 0.19/0.47 = { by axiom 2 (f03) }
% 0.19/0.47 mult(mult(rd(X, X), rd(Y, rd(rd(X, rd(X, X)), mult(X, rd(X, X))))), rd(X, X))
% 0.19/0.47 = { by lemma 13 }
% 0.19/0.47 mult(mult(rd(X, X), rd(Y, rd(mult(X, rd(X, X)), mult(X, rd(X, X))))), rd(X, X))
% 0.19/0.47 = { by lemma 12 }
% 0.19/0.47 mult(mult(rd(X, X), rd(Y, rd(X, mult(X, rd(X, X))))), rd(X, X))
% 0.19/0.47 = { by lemma 12 }
% 0.19/0.47 mult(mult(rd(X, X), rd(Y, rd(X, X))), rd(X, X))
% 0.19/0.47 = { by lemma 14 R->L }
% 0.19/0.47 mult(rd(X, X), mult(ld(rd(X, X), rd(X, X)), mult(rd(Y, rd(X, X)), rd(X, X))))
% 0.19/0.47 = { by axiom 2 (f03) }
% 0.19/0.47 mult(rd(X, X), mult(ld(rd(X, X), rd(X, X)), Y))
% 0.19/0.47 = { by lemma 15 }
% 0.19/0.47 mult(rd(X, X), mult(rd(X, X), Y))
% 0.19/0.47
% 0.19/0.47 Lemma 17: rd(X, rd(Y, Y)) = mult(rd(Y, Y), X).
% 0.19/0.47 Proof:
% 0.19/0.47 rd(X, rd(Y, Y))
% 0.19/0.47 = { by axiom 1 (f01) R->L }
% 0.19/0.47 rd(mult(rd(Y, Y), ld(rd(Y, Y), X)), rd(Y, Y))
% 0.19/0.47 = { by lemma 16 }
% 0.19/0.47 mult(rd(Y, Y), mult(rd(Y, Y), ld(rd(Y, Y), X)))
% 0.19/0.47 = { by axiom 1 (f01) }
% 0.19/0.47 mult(rd(Y, Y), X)
% 0.19/0.47
% 0.19/0.47 Lemma 18: mult(rd(X, X), mult(Y, rd(X, X))) = Y.
% 0.19/0.47 Proof:
% 0.19/0.47 mult(rd(X, X), mult(Y, rd(X, X)))
% 0.19/0.47 = { by lemma 17 R->L }
% 0.19/0.47 rd(mult(Y, rd(X, X)), rd(X, X))
% 0.19/0.47 = { by axiom 3 (f04) }
% 0.19/0.47 Y
% 0.19/0.47
% 0.19/0.47 Lemma 19: mult(rd(X, X), Y) = Y.
% 0.19/0.47 Proof:
% 0.19/0.47 mult(rd(X, X), Y)
% 0.19/0.47 = { by lemma 18 R->L }
% 0.19/0.47 mult(rd(X, X), mult(rd(X, X), mult(Y, rd(X, X))))
% 0.19/0.47 = { by lemma 15 R->L }
% 0.19/0.47 mult(rd(X, X), mult(ld(rd(X, X), rd(X, X)), mult(Y, rd(X, X))))
% 0.19/0.47 = { by lemma 14 }
% 0.19/0.47 mult(mult(rd(X, X), Y), rd(X, X))
% 0.19/0.47 = { by lemma 17 R->L }
% 0.19/0.47 mult(rd(Y, rd(X, X)), rd(X, X))
% 0.19/0.47 = { by axiom 2 (f03) }
% 0.19/0.47 Y
% 0.19/0.47
% 0.19/0.47 Goal 1 (goal): mult(x0, rd(x1, x1)) = x0.
% 0.19/0.47 Proof:
% 0.19/0.47 mult(x0, rd(x1, x1))
% 0.19/0.47 = { by axiom 3 (f04) R->L }
% 0.19/0.47 mult(x0, rd(mult(rd(x1, x1), ld(rd(x1, x1), rd(x1, x1))), ld(rd(x1, x1), rd(x1, x1))))
% 0.19/0.47 = { by axiom 1 (f01) }
% 0.19/0.47 mult(x0, rd(rd(x1, x1), ld(rd(x1, x1), rd(x1, x1))))
% 0.19/0.47 = { by lemma 15 }
% 0.19/0.47 mult(x0, rd(rd(x1, x1), rd(x1, x1)))
% 0.19/0.47 = { by lemma 19 R->L }
% 0.19/0.47 mult(mult(rd(x1, x1), x0), rd(rd(x1, x1), rd(x1, x1)))
% 0.19/0.47 = { by lemma 9 R->L }
% 0.19/0.47 rd(mult(rd(x1, x1), mult(x0, rd(x1, x1))), rd(x1, x1))
% 0.19/0.47 = { by lemma 16 }
% 0.19/0.47 mult(rd(x1, x1), mult(rd(x1, x1), mult(x0, rd(x1, x1))))
% 0.19/0.47 = { by lemma 18 }
% 0.19/0.47 mult(rd(x1, x1), x0)
% 0.19/0.47 = { by lemma 19 }
% 0.19/0.47 x0
% 0.19/0.47 % SZS output end Proof
% 0.19/0.47
% 0.19/0.47 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------