TSTP Solution File: GEO148-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GEO148-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 : n019.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:27:39 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO148-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/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 : n019.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 19:13:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.58 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 0.19/0.58
% 0.19/0.58 % SZS status Unsatisfiable
% 0.19/0.58
% 0.19/0.58 % SZS output start Proof
% 0.19/0.58 Take the following subset of the input axioms:
% 0.19/0.58 fof(between_c_defn_1, axiom, ![A, B, C, D]: (~between_c(A, B, C, D) | B!=D)).
% 0.19/0.58 fof(c6_42, axiom, ![A3, B2]: (~end_point(A3, B2) | A3!=ax0_sk11(A3, B2))).
% 0.19/0.58 fof(closed_defn_31, axiom, ![A3, B2]: (~closed(A3) | ~end_point(B2, A3))).
% 0.19/0.58 fof(connect_defn_1, axiom, ![A2, B2, C2]: (~connect(A2, B2, C2) | once(at_the_same_time(at(A2, C2), at(B2, C2))))).
% 0.19/0.58 fof(homogeneous_behaviour_13, axiom, ![E, F, A3, B2, C2, D2]: (~once(at_the_same_time(at(A3, B2), at(C2, D2))) | (~once(at_the_same_time(at(A3, E), at(C2, F))) | (~ordered_by(trajectory_of(A3), B2, E) | ~ordered_by(trajectory_of(C2), F, D2))))).
% 0.19/0.58 fof(inner_point_defn_22, axiom, ![A3, B2]: (~inner_point(A3, B2) | ~end_point(A3, B2))).
% 0.19/0.58 fof(t14_156, negated_conjecture, connect(sk28, sk29, sk27)).
% 0.19/0.58 fof(t14_157, negated_conjecture, ordered_by(trajectory_of(sk29), sk31, sk27)).
% 0.19/0.58 fof(t14_158, negated_conjecture, ordered_by(trajectory_of(sk28), sk27, sk30)).
% 0.19/0.58 fof(t14_159, negated_conjecture, once(at_the_same_time(at(sk28, sk30), at(sk29, sk31)))).
% 0.19/0.58
% 0.19/0.58 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.58 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.58 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.58 fresh(y, y, x1...xn) = u
% 0.19/0.58 C => fresh(s, t, x1...xn) = v
% 0.19/0.58 where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.58 variables of u and v.
% 0.19/0.58 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.58 input problem has no model of domain size 1).
% 0.19/0.58
% 0.19/0.58 The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.58
% 0.19/0.58 Axiom 1 (t14_156): connect(sk28, sk29, sk27) = true2.
% 0.19/0.58 Axiom 2 (t14_158): ordered_by(trajectory_of(sk28), sk27, sk30) = true2.
% 0.19/0.58 Axiom 3 (t14_157): ordered_by(trajectory_of(sk29), sk31, sk27) = true2.
% 0.19/0.58 Axiom 4 (connect_defn_1): fresh60(X, X, Y, Z, W) = true2.
% 0.19/0.58 Axiom 5 (t14_159): once(at_the_same_time(at(sk28, sk30), at(sk29, sk31))) = true2.
% 0.19/0.58 Axiom 6 (connect_defn_1): fresh60(connect(X, Y, Z), true2, X, Y, Z) = once(at_the_same_time(at(X, Z), at(Y, Z))).
% 0.19/0.58
% 0.19/0.58 Goal 1 (homogeneous_behaviour_13): tuple(ordered_by(trajectory_of(X), Y, Z), ordered_by(trajectory_of(W), V, U), once(at_the_same_time(at(X, Y), at(W, U))), once(at_the_same_time(at(X, Z), at(W, V)))) = tuple(true2, true2, true2, true2).
% 0.19/0.58 The goal is true when:
% 0.19/0.58 X = sk28
% 0.19/0.58 Y = sk27
% 0.19/0.58 Z = sk30
% 0.19/0.58 W = sk29
% 0.19/0.58 V = sk31
% 0.19/0.58 U = sk27
% 0.19/0.58
% 0.19/0.58 Proof:
% 0.19/0.58 tuple(ordered_by(trajectory_of(sk28), sk27, sk30), ordered_by(trajectory_of(sk29), sk31, sk27), once(at_the_same_time(at(sk28, sk27), at(sk29, sk27))), once(at_the_same_time(at(sk28, sk30), at(sk29, sk31))))
% 0.19/0.58 = { by axiom 5 (t14_159) }
% 0.19/0.58 tuple(ordered_by(trajectory_of(sk28), sk27, sk30), ordered_by(trajectory_of(sk29), sk31, sk27), once(at_the_same_time(at(sk28, sk27), at(sk29, sk27))), true2)
% 0.19/0.58 = { by axiom 6 (connect_defn_1) R->L }
% 0.19/0.58 tuple(ordered_by(trajectory_of(sk28), sk27, sk30), ordered_by(trajectory_of(sk29), sk31, sk27), fresh60(connect(sk28, sk29, sk27), true2, sk28, sk29, sk27), true2)
% 0.19/0.58 = { by axiom 1 (t14_156) }
% 0.19/0.58 tuple(ordered_by(trajectory_of(sk28), sk27, sk30), ordered_by(trajectory_of(sk29), sk31, sk27), fresh60(true2, true2, sk28, sk29, sk27), true2)
% 0.19/0.58 = { by axiom 4 (connect_defn_1) }
% 0.19/0.58 tuple(ordered_by(trajectory_of(sk28), sk27, sk30), ordered_by(trajectory_of(sk29), sk31, sk27), true2, true2)
% 0.19/0.58 = { by axiom 2 (t14_158) }
% 0.19/0.58 tuple(true2, ordered_by(trajectory_of(sk29), sk31, sk27), true2, true2)
% 0.19/0.58 = { by axiom 3 (t14_157) }
% 0.19/0.58 tuple(true2, true2, true2, true2)
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58
% 0.19/0.58 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------