TSTP Solution File: GEO257+3 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GEO257+3 : TPTP v8.1.2. Released v4.0.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 : n016.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 23:28:25 EDT 2023
% Result : Theorem 0.19s 0.44s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO257+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 21:16:16 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.44 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 0.19/0.44
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44
% 0.19/0.44 % SZS output start Proof
% 0.19/0.44 Take the following subset of the input axioms:
% 0.19/0.44 fof(a4_defns, axiom, ![X, Y]: (equally_directed_lines(X, Y) <=> ~unequally_directed_lines(X, Y))).
% 0.19/0.44 fof(a5_defns, axiom, ![X2, Y2]: (equally_directed_opposite_lines(X2, Y2) <=> ~unequally_directed_opposite_lines(X2, Y2))).
% 0.19/0.44 fof(ax10_basics, axiom, ![A, L]: ~(left_apart_point(A, L) | left_apart_point(A, reverse_line(L)))).
% 0.19/0.44 fof(ax11_basics, axiom, ![M, L2]: ~(left_convergent_lines(L2, M) | left_convergent_lines(L2, reverse_line(M)))).
% 0.19/0.44 fof(ax1_basics, axiom, ![A2]: ~distinct_points(A2, A2)).
% 0.19/0.44 fof(ax3_basics, axiom, ![L2]: ~distinct_lines(L2, L2)).
% 0.19/0.44 fof(ax5_cons_objs, axiom, ![B, A2]: (distinct_points(A2, B) => (~apart_point_and_line(A2, line_connecting(A2, B)) & ~apart_point_and_line(B, line_connecting(A2, B))))).
% 0.19/0.44 fof(ax6_cons_objs, axiom, ![L2, M2]: ((unequally_directed_lines(L2, M2) & unequally_directed_lines(L2, reverse_line(M2))) => (~apart_point_and_line(intersection_point(L2, M2), L2) & ~apart_point_and_line(intersection_point(L2, M2), M2)))).
% 0.19/0.44 fof(ax7_cons_objs, axiom, ![A2, L2]: ~apart_point_and_line(A2, parallel_through_point(L2, A2))).
% 0.19/0.44 fof(ax8_cons_objs, axiom, ![L2]: ~distinct_lines(L2, reverse_line(L2))).
% 0.19/0.44 fof(con, conjecture, ![C, D, A2, L2, B2]: ((distinct_points(A2, C) & (distinct_points(B2, C) & (incident_point_and_line(C, L2) & left_apart_point(D, L2)))) => ((before_on_line(L2, A2, B2) & before_on_line(L2, B2, C)) => before_on_line(L2, A2, C)))).
% 0.19/0.44
% 0.19/0.44 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.44 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.44 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.44 fresh(y, y, x1...xn) = u
% 0.19/0.44 C => fresh(s, t, x1...xn) = v
% 0.19/0.44 where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.44 variables of u and v.
% 0.19/0.44 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.44 input problem has no model of domain size 1).
% 0.19/0.44
% 0.19/0.44 The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.44
% 0.19/0.44 Axiom 1 (con): left_apart_point(d, l) = true2.
% 0.19/0.44
% 0.19/0.44 Goal 1 (ax10_basics): left_apart_point(X, Y) = true2.
% 0.19/0.44 The goal is true when:
% 0.19/0.44 X = d
% 0.19/0.44 Y = l
% 0.19/0.44
% 0.19/0.44 Proof:
% 0.19/0.44 left_apart_point(d, l)
% 0.19/0.44 = { by axiom 1 (con) }
% 0.19/0.44 true2
% 0.19/0.44 % SZS output end Proof
% 0.19/0.44
% 0.19/0.44 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------