TSTP Solution File: GRP698-1 by Twee---2.5.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.5.0
% Problem : GRP698-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee /export/starexec/sandbox/benchmark/theBenchmark.p --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding
% Computer : n029.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 Jun 24 07:13:29 EDT 2024
% Result : Unsatisfiable 0.19s 0.50s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP698-1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : parallel-twee /export/starexec/sandbox/benchmark/theBenchmark.p --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 12:40:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.50 Command-line arguments: --no-flatten-goal
% 0.19/0.50
% 0.19/0.50 % SZS status Unsatisfiable
% 0.19/0.50
% 0.19/0.51 % SZS output start Proof
% 0.19/0.51 Axiom 1 (c05): mult(X, unit) = X.
% 0.19/0.51 Axiom 2 (c02): ld(X, mult(X, Y)) = Y.
% 0.19/0.51 Axiom 3 (c01): mult(X, ld(X, Y)) = Y.
% 0.19/0.51 Axiom 4 (c03): mult(rd(X, Y), Y) = X.
% 0.19/0.51 Axiom 5 (c07): mult(mult(mult(X, Y), X), mult(X, Z)) = mult(X, mult(mult(mult(Y, X), X), Z)).
% 0.19/0.51
% 0.19/0.51 Goal 1 (goals): mult(a, mult(b, c)) = mult(rd(mult(a, b), a), mult(a, c)).
% 0.19/0.51 Proof:
% 0.19/0.51 mult(a, mult(b, c))
% 0.19/0.51 = { by axiom 2 (c02) R->L }
% 0.19/0.51 mult(a, mult(ld(a, mult(a, b)), c))
% 0.19/0.51 = { by axiom 4 (c03) R->L }
% 0.19/0.51 mult(a, mult(ld(a, mult(rd(mult(a, b), a), a)), c))
% 0.19/0.51 = { by axiom 4 (c03) R->L }
% 0.19/0.51 mult(a, mult(ld(a, mult(mult(rd(rd(mult(a, b), a), a), a), a)), c))
% 0.19/0.51 = { by axiom 3 (c01) R->L }
% 0.19/0.51 mult(a, mult(ld(a, mult(mult(mult(a, ld(a, rd(rd(mult(a, b), a), a))), a), a)), c))
% 0.19/0.51 = { by axiom 1 (c05) R->L }
% 0.19/0.51 mult(a, mult(ld(a, mult(mult(mult(a, ld(a, rd(rd(mult(a, b), a), a))), a), mult(a, unit))), c))
% 0.19/0.51 = { by axiom 5 (c07) }
% 0.19/0.51 mult(a, mult(ld(a, mult(a, mult(mult(mult(ld(a, rd(rd(mult(a, b), a), a)), a), a), unit))), c))
% 0.19/0.51 = { by axiom 1 (c05) }
% 0.19/0.51 mult(a, mult(ld(a, mult(a, mult(mult(ld(a, rd(rd(mult(a, b), a), a)), a), a))), c))
% 0.19/0.51 = { by axiom 2 (c02) }
% 0.19/0.51 mult(a, mult(mult(mult(ld(a, rd(rd(mult(a, b), a), a)), a), a), c))
% 0.19/0.51 = { by axiom 5 (c07) R->L }
% 0.19/0.51 mult(mult(mult(a, ld(a, rd(rd(mult(a, b), a), a))), a), mult(a, c))
% 0.19/0.51 = { by axiom 3 (c01) }
% 0.19/0.51 mult(mult(rd(rd(mult(a, b), a), a), a), mult(a, c))
% 0.19/0.51 = { by axiom 4 (c03) }
% 0.19/0.51 mult(rd(mult(a, b), a), mult(a, c))
% 0.19/0.51 % SZS output end Proof
% 0.19/0.51
% 0.19/0.51 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------