TSTP Solution File: SWC128+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWC128+1 : TPTP v8.1.2. Released v2.4.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 : n004.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 20:54:00 EDT 2023
% Result : Theorem 2.96s 0.80s
% Output : Proof 2.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC128+1 : TPTP v8.1.2. Released v2.4.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.14/0.33 % Computer : n004.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 17:52:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.96/0.80 Command-line arguments: --ground-connectedness --complete-subsets
% 2.96/0.80
% 2.96/0.80 % SZS status Theorem
% 2.96/0.80
% 2.96/0.80 % SZS output start Proof
% 2.96/0.80 Take the following subset of the input axioms:
% 2.96/0.80 fof(co1, conjecture, $true).
% 2.96/0.80
% 2.96/0.80 Now clausify the problem and encode Horn clauses using encoding 3 of
% 2.96/0.80 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 2.96/0.80 We repeatedly replace C & s=t => u=v by the two clauses:
% 2.96/0.80 fresh(y, y, x1...xn) = u
% 2.96/0.80 C => fresh(s, t, x1...xn) = v
% 2.96/0.80 where fresh is a fresh function symbol and x1..xn are the free
% 2.96/0.80 variables of u and v.
% 2.96/0.80 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 2.96/0.80 input problem has no model of domain size 1).
% 2.96/0.80
% 2.96/0.80 The encoding turns the above axioms into the following unit equations and goals:
% 2.96/0.80
% 2.96/0.80
% 2.96/0.80 Goal 1 (co1): tuple6 = tuple6.
% 2.96/0.80 Proof:
% 2.96/0.80 Reflexivity.
% 2.96/0.80 % SZS output end Proof
% 2.96/0.81
% 2.96/0.81 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------