TSTP Solution File: SWV062+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV062+1 : TPTP v8.1.2. Bugfixed v3.3.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 : n028.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 23:02:24 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV062+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.11/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.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 06:35:55 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.58 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.19/0.58
% 0.19/0.58 % SZS status Theorem
% 0.19/0.58
% 0.19/0.58 % SZS output start Proof
% 0.19/0.58 Take the following subset of the input axioms:
% 0.19/0.58 fof(cl5_nebula_array_0003, conjecture, (leq(n0, pv10) & (leq(n0, pv41) & (leq(n0, pv43) & (leq(pv10, minus(n135300, n1)) & (leq(pv41, minus(n5, n1)) & leq(pv43, minus(n5, n1))))))) => (leq(n0, pv10) & (leq(n0, pv41) & (leq(n0, pv43) & (leq(pv10, minus(n135300, n1)) & (leq(pv41, minus(n5, n1)) & leq(pv43, minus(n5, n1)))))))).
% 0.19/0.58
% 0.19/0.58 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.58 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.58 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.58 fresh(y, y, x1...xn) = u
% 0.19/0.58 C => fresh(s, t, x1...xn) = v
% 0.19/0.58 where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.58 variables of u and v.
% 0.19/0.58 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.58 input problem has no model of domain size 1).
% 0.19/0.58
% 0.19/0.58 The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.58
% 0.19/0.58 Axiom 1 (cl5_nebula_array_0003): leq(n0, pv10) = true3.
% 0.19/0.58 Axiom 2 (cl5_nebula_array_0003_1): leq(n0, pv41) = true3.
% 0.19/0.58 Axiom 3 (cl5_nebula_array_0003_2): leq(n0, pv43) = true3.
% 0.19/0.58 Axiom 4 (cl5_nebula_array_0003_3): leq(pv10, minus(n135300, n1)) = true3.
% 0.19/0.58 Axiom 5 (cl5_nebula_array_0003_4): leq(pv41, minus(n5, n1)) = true3.
% 0.19/0.58 Axiom 6 (cl5_nebula_array_0003_5): leq(pv43, minus(n5, n1)) = true3.
% 0.19/0.58
% 0.19/0.58 Goal 1 (cl5_nebula_array_0003_6): tuple(leq(n0, pv10), leq(n0, pv41), leq(n0, pv43), leq(pv10, minus(n135300, n1)), leq(pv41, minus(n5, n1)), leq(pv43, minus(n5, n1))) = tuple(true3, true3, true3, true3, true3, true3).
% 0.19/0.58 Proof:
% 0.19/0.58 tuple(leq(n0, pv10), leq(n0, pv41), leq(n0, pv43), leq(pv10, minus(n135300, n1)), leq(pv41, minus(n5, n1)), leq(pv43, minus(n5, n1)))
% 0.19/0.58 = { by axiom 1 (cl5_nebula_array_0003) }
% 0.19/0.58 tuple(true3, leq(n0, pv41), leq(n0, pv43), leq(pv10, minus(n135300, n1)), leq(pv41, minus(n5, n1)), leq(pv43, minus(n5, n1)))
% 0.19/0.58 = { by axiom 2 (cl5_nebula_array_0003_1) }
% 0.19/0.58 tuple(true3, true3, leq(n0, pv43), leq(pv10, minus(n135300, n1)), leq(pv41, minus(n5, n1)), leq(pv43, minus(n5, n1)))
% 0.19/0.58 = { by axiom 3 (cl5_nebula_array_0003_2) }
% 0.19/0.58 tuple(true3, true3, true3, leq(pv10, minus(n135300, n1)), leq(pv41, minus(n5, n1)), leq(pv43, minus(n5, n1)))
% 0.19/0.58 = { by axiom 4 (cl5_nebula_array_0003_3) }
% 0.19/0.58 tuple(true3, true3, true3, true3, leq(pv41, minus(n5, n1)), leq(pv43, minus(n5, n1)))
% 0.19/0.58 = { by axiom 5 (cl5_nebula_array_0003_4) }
% 0.19/0.58 tuple(true3, true3, true3, true3, true3, leq(pv43, minus(n5, n1)))
% 0.19/0.58 = { by axiom 6 (cl5_nebula_array_0003_5) }
% 0.19/0.58 tuple(true3, true3, true3, true3, true3, true3)
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58
% 0.19/0.58 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------