TSTP Solution File: CSR043+2 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : CSR043+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 : n015.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:17 EDT 2023
% Result : Theorem 25.78s 3.74s
% Output : Proof 26.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR043+2 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 11:50:40 EDT 2023
% 0.12/0.34 % CPUTime :
% 25.78/3.74 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 25.78/3.74
% 25.78/3.74 % SZS status Theorem
% 25.78/3.74
% 25.78/3.74 % SZS output start Proof
% 25.78/3.74 Take the following subset of the input axioms:
% 25.78/3.74 fof(ax1_252, axiom, genls(c_tptpcol_16_30972, c_tptpcol_15_30970)).
% 25.78/3.74 fof(query93, conjecture, mtvisible(c_tptp_member2862_mt) => genls(c_tptpcol_16_30972, c_tptpcol_15_30970)).
% 25.78/3.74
% 25.78/3.74 Now clausify the problem and encode Horn clauses using encoding 3 of
% 25.78/3.74 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 25.78/3.74 We repeatedly replace C & s=t => u=v by the two clauses:
% 25.78/3.74 fresh(y, y, x1...xn) = u
% 25.78/3.74 C => fresh(s, t, x1...xn) = v
% 25.78/3.74 where fresh is a fresh function symbol and x1..xn are the free
% 25.78/3.74 variables of u and v.
% 25.78/3.74 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 25.78/3.74 input problem has no model of domain size 1).
% 25.78/3.74
% 25.78/3.74 The encoding turns the above axioms into the following unit equations and goals:
% 25.78/3.74
% 25.78/3.74 Axiom 1 (ax1_252): genls(c_tptpcol_16_30972, c_tptpcol_15_30970) = true2.
% 25.78/3.74
% 25.78/3.74 Goal 1 (query93_1): genls(c_tptpcol_16_30972, c_tptpcol_15_30970) = true2.
% 25.78/3.74 Proof:
% 25.78/3.74 genls(c_tptpcol_16_30972, c_tptpcol_15_30970)
% 26.35/3.74 = { by axiom 1 (ax1_252) }
% 26.35/3.74 true2
% 26.35/3.74 % SZS output end Proof
% 26.35/3.74
% 26.35/3.74 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------