TSTP Solution File: CSR051+2 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : CSR051+2 : TPTP v8.1.2. Released v3.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 : n017.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 : Wed Aug 30 21:41:25 EDT 2023
% Result : Theorem 25.21s 3.66s
% Output : Proof 25.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR051+2 : TPTP v8.1.2. Released v3.4.0.
% 0.12/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.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 11:57:57 EDT 2023
% 0.13/0.35 % CPUTime :
% 25.21/3.66 Command-line arguments: --no-flatten-goal
% 25.21/3.66
% 25.21/3.66 % SZS status Theorem
% 25.21/3.66
% 25.21/3.66 % SZS output start Proof
% 25.21/3.66 Take the following subset of the input axioms:
% 25.21/3.66 fof(ax1_153, axiom, ![OBJ]: ~(tptpcol_1_1(OBJ) & tptpcol_1_65536(OBJ))).
% 25.21/3.66 fof(ax1_167, axiom, ![OBJ2]: ~(individual(OBJ2) & setorcollection(OBJ2))).
% 25.21/3.66 fof(ax1_289, axiom, ![OBJ2]: ~(collection(OBJ2) & individual(OBJ2))).
% 25.21/3.66 fof(ax1_3, axiom, ![OBJ2]: ~(intangible(OBJ2) & partiallytangible(OBJ2))).
% 25.21/3.66 fof(ax1_363, axiom, ![COL1, COL2, OBJ2]: ~(isa(OBJ2, COL1) & (isa(OBJ2, COL2) & disjointwith(COL1, COL2)))).
% 25.21/3.66 fof(ax1_488, axiom, ![OBJ2]: ~(tptpcol_3_98305(OBJ2) & tptpcol_3_114688(OBJ2))).
% 25.21/3.66 fof(ax1_51, axiom, mtvisible(c_tptp_member3356_mt) => marriagelicensedocument(c_tptpmarriagelicensedocument)).
% 25.21/3.66 fof(ax1_521, axiom, ![X]: ~affiliatedwith(X, X)).
% 25.21/3.66 fof(ax1_698, axiom, ![X2]: ~objectfoundinlocation(X2, X2)).
% 25.21/3.66 fof(ax1_901, axiom, ![X2]: ~borderson(X2, X2)).
% 25.21/3.66 fof(query101, conjecture, ?[X2]: (mtvisible(c_tptp_member3356_mt) => marriagelicensedocument(X2))).
% 25.21/3.66
% 25.21/3.66 Now clausify the problem and encode Horn clauses using encoding 3 of
% 25.21/3.66 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 25.21/3.66 We repeatedly replace C & s=t => u=v by the two clauses:
% 25.21/3.66 fresh(y, y, x1...xn) = u
% 25.21/3.66 C => fresh(s, t, x1...xn) = v
% 25.21/3.66 where fresh is a fresh function symbol and x1..xn are the free
% 25.21/3.66 variables of u and v.
% 25.21/3.66 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 25.21/3.66 input problem has no model of domain size 1).
% 25.21/3.66
% 25.21/3.66 The encoding turns the above axioms into the following unit equations and goals:
% 25.21/3.66
% 25.21/3.66 Axiom 1 (query101): mtvisible(c_tptp_member3356_mt) = true2.
% 25.21/3.66 Axiom 2 (ax1_51): fresh471(X, X) = true2.
% 25.21/3.67 Axiom 3 (ax1_51): fresh471(mtvisible(c_tptp_member3356_mt), true2) = marriagelicensedocument(c_tptpmarriagelicensedocument).
% 25.21/3.67
% 25.21/3.67 Goal 1 (query101_1): marriagelicensedocument(X) = true2.
% 25.21/3.67 The goal is true when:
% 25.21/3.67 X = c_tptpmarriagelicensedocument
% 25.21/3.67
% 25.21/3.67 Proof:
% 25.21/3.67 marriagelicensedocument(c_tptpmarriagelicensedocument)
% 25.21/3.67 = { by axiom 3 (ax1_51) R->L }
% 25.21/3.67 fresh471(mtvisible(c_tptp_member3356_mt), true2)
% 25.21/3.67 = { by axiom 1 (query101) }
% 25.21/3.67 fresh471(true2, true2)
% 25.21/3.67 = { by axiom 2 (ax1_51) }
% 25.21/3.67 true2
% 25.21/3.67 % SZS output end Proof
% 25.21/3.67
% 25.21/3.67 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------