TSTP Solution File: SWV059+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV059+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 : n006.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:23 EDT 2023
% Result : Theorem 1.61s 0.60s
% Output : Proof 1.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWV059+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.14 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Aug 29 04:01:06 EDT 2023
% 0.15/0.36 % CPUTime :
% 1.61/0.60 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 1.61/0.60
% 1.61/0.60 % SZS status Theorem
% 1.61/0.60
% 1.61/0.60 % SZS output start Proof
% 1.61/0.60 Take the following subset of the input axioms:
% 1.61/0.60 fof(cl5_nebula_norm_0049, conjecture, geq(pv72, tptp_float_0_001) => ((~gt(plus(n1, loopcounter), n1) => true) & (gt(plus(n1, loopcounter), n1) => true))).
% 1.61/0.60 fof(ttrue, axiom, true).
% 1.61/0.60
% 1.61/0.60 Now clausify the problem and encode Horn clauses using encoding 3 of
% 1.61/0.60 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 1.61/0.60 We repeatedly replace C & s=t => u=v by the two clauses:
% 1.61/0.60 fresh(y, y, x1...xn) = u
% 1.61/0.60 C => fresh(s, t, x1...xn) = v
% 1.61/0.60 where fresh is a fresh function symbol and x1..xn are the free
% 1.61/0.60 variables of u and v.
% 1.61/0.60 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 1.61/0.60 input problem has no model of domain size 1).
% 1.61/0.60
% 1.61/0.60 The encoding turns the above axioms into the following unit equations and goals:
% 1.61/0.60
% 1.61/0.60 Axiom 1 (ttrue): true = true3.
% 1.61/0.60 Axiom 2 (cl5_nebula_norm_0049_3): fresh40(X, X) = true3.
% 1.61/0.60 Axiom 3 (cl5_nebula_norm_0049_3): fresh40(true, true3) = gt(plus(n1, loopcounter), n1).
% 1.61/0.60
% 1.61/0.60 Goal 1 (cl5_nebula_norm_0049_2): true = true3.
% 1.61/0.60 Proof:
% 1.61/0.60 true
% 1.61/0.60 = { by axiom 1 (ttrue) }
% 1.61/0.60 true3
% 1.61/0.60
% 1.61/0.60 Goal 2 (cl5_nebula_norm_0049_1): tuple(gt(plus(n1, loopcounter), n1), true) = tuple(true3, true3).
% 1.61/0.60 Proof:
% 1.61/0.60 tuple(gt(plus(n1, loopcounter), n1), true)
% 1.61/0.60 = { by axiom 3 (cl5_nebula_norm_0049_3) R->L }
% 1.61/0.60 tuple(fresh40(true, true3), true)
% 1.61/0.60 = { by axiom 1 (ttrue) }
% 1.61/0.60 tuple(fresh40(true3, true3), true)
% 1.61/0.60 = { by axiom 2 (cl5_nebula_norm_0049_3) }
% 1.61/0.60 tuple(true3, true)
% 1.61/0.60 = { by axiom 1 (ttrue) }
% 1.61/0.60 tuple(true3, true3)
% 1.61/0.60 % SZS output end Proof
% 1.61/0.60
% 1.61/0.60 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------