TSTP Solution File: GRP702-11 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP702-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 : n024.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:46 EDT 2023
% Result : Unsatisfiable 0.13s 0.39s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP702-11 : TPTP v8.1.2. Released v8.1.0.
% 0.07/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 : n024.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:50:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.39 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.13/0.39
% 0.13/0.39 % SZS status Unsatisfiable
% 0.13/0.39
% 0.13/0.40 % SZS output start Proof
% 0.13/0.40 Axiom 1 (f02): ld(X, mult(X, Y)) = Y.
% 0.13/0.40 Axiom 2 (f11): op_d = ld(X, mult(op_c, X)).
% 0.13/0.40 Axiom 3 (f09): mult(X, mult(Y, op_c)) = mult(mult(X, Y), op_c).
% 0.13/0.40
% 0.13/0.40 Lemma 4: op_c = op_d.
% 0.13/0.40 Proof:
% 0.13/0.40 op_c
% 0.13/0.40 = { by axiom 1 (f02) R->L }
% 0.13/0.40 ld(op_c, mult(op_c, op_c))
% 0.13/0.40 = { by axiom 2 (f11) R->L }
% 0.13/0.40 op_d
% 0.13/0.40
% 0.13/0.40 Goal 1 (goal): mult(x0, mult(x1, op_d)) = mult(mult(x0, x1), op_d).
% 0.13/0.40 Proof:
% 0.13/0.40 mult(x0, mult(x1, op_d))
% 0.13/0.40 = { by lemma 4 R->L }
% 0.13/0.40 mult(x0, mult(x1, op_c))
% 0.13/0.40 = { by axiom 3 (f09) }
% 0.13/0.40 mult(mult(x0, x1), op_c)
% 0.13/0.40 = { by lemma 4 }
% 0.13/0.40 mult(mult(x0, x1), op_d)
% 0.13/0.40 % SZS output end Proof
% 0.13/0.40
% 0.13/0.40 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------