TSTP Solution File: SYN642-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SYN642-1 : TPTP v8.1.2. Released v2.5.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 : n003.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 : Fri Sep 1 03:35:33 EDT 2023
% Result : Unsatisfiable 0.21s 0.56s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN642-1 : TPTP v8.1.2. Released v2.5.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.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 19:18:09 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.56 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 0.21/0.56
% 0.21/0.56 % SZS status Unsatisfiable
% 0.21/0.56
% 0.21/0.56 % SZS output start Proof
% 0.21/0.56 Take the following subset of the input axioms:
% 0.21/0.56 fof(f3_is_p15_1, negated_conjecture, p15(f3(c19))).
% 0.21/0.56 fof(f3_is_p15_2, negated_conjecture, p15(f3(c18))).
% 0.21/0.56 fof(not_p6_28, negated_conjecture, ~p6(f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))).
% 0.21/0.56 fof(p6_14, negated_conjecture, p6(f8(f3(c18)), f8(c18))).
% 0.21/0.56 fof(p6_23, negated_conjecture, ![X45, X46, X47]: (p6(X46, X47) | (~p6(X45, X46) | ~p6(X45, X47)))).
% 0.21/0.56 fof(p6_33, negated_conjecture, ![X52, X53, X54, X55]: (p6(f9(X52, X53), f9(X54, X55)) | (~p6(X53, X55) | ~p6(X52, X54)))).
% 0.21/0.56 fof(p6_36, negated_conjecture, ![X14, X15]: (p6(f8(f10(X14, X15)), f9(f8(X14), f8(X15))) | (~p15(X14) | ~p15(X15)))).
% 0.21/0.56 fof(p6_4, negated_conjecture, ![X45_2]: p6(X45_2, X45_2)).
% 0.21/0.56 fof(p6_9, negated_conjecture, p6(f8(f3(c19)), f8(c19))).
% 0.21/0.56
% 0.21/0.56 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.21/0.56 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.21/0.56 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.21/0.56 fresh(y, y, x1...xn) = u
% 0.21/0.56 C => fresh(s, t, x1...xn) = v
% 0.21/0.56 where fresh is a fresh function symbol and x1..xn are the free
% 0.21/0.56 variables of u and v.
% 0.21/0.56 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.21/0.56 input problem has no model of domain size 1).
% 0.21/0.56
% 0.21/0.56 The encoding turns the above axioms into the following unit equations and goals:
% 0.21/0.56
% 0.21/0.56 Axiom 1 (p6_4): p6(X, X) = true.
% 0.21/0.56 Axiom 2 (f3_is_p15_1): p15(f3(c19)) = true.
% 0.21/0.56 Axiom 3 (f3_is_p15_2): p15(f3(c18)) = true.
% 0.21/0.56 Axiom 4 (p6_36): fresh37(X, X, Y, Z) = true.
% 0.21/0.56 Axiom 5 (p6_23): fresh3(X, X, Y, Z) = true.
% 0.21/0.56 Axiom 6 (p6_9): p6(f8(f3(c19)), f8(c19)) = true.
% 0.21/0.56 Axiom 7 (p6_14): p6(f8(f3(c18)), f8(c18)) = true.
% 0.21/0.56 Axiom 8 (p6_36): fresh36(X, X, Y, Z) = fresh37(p15(Y), true, Y, Z).
% 0.21/0.56 Axiom 9 (p6_23): fresh4(X, X, Y, Z, W) = p6(Y, Z).
% 0.21/0.56 Axiom 10 (p6_33): fresh(X, X, Y, Z, W, V) = true.
% 0.21/0.56 Axiom 11 (p6_23): fresh4(p6(X, Y), true, Z, Y, X) = fresh3(p6(X, Z), true, Z, Y).
% 0.21/0.56 Axiom 12 (p6_33): fresh2(X, X, Y, Z, W, V) = p6(f9(Y, Z), f9(W, V)).
% 0.21/0.56 Axiom 13 (p6_36): fresh36(p15(X), true, Y, X) = p6(f8(f10(Y, X)), f9(f8(Y), f8(X))).
% 0.21/0.56 Axiom 14 (p6_33): fresh2(p6(X, Y), true, Z, X, W, Y) = fresh(p6(Z, W), true, Z, X, W, Y).
% 0.21/0.56
% 0.21/0.56 Goal 1 (not_p6_28): p6(f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18))) = true.
% 0.21/0.56 Proof:
% 0.21/0.56 p6(f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.56 = { by axiom 9 (p6_23) R->L }
% 0.21/0.56 fresh4(true, true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)), f9(f8(f3(c19)), f8(f3(c18))))
% 0.21/0.56 = { by axiom 10 (p6_33) R->L }
% 0.21/0.57 fresh4(fresh(true, true, f8(f3(c19)), f8(f3(c18)), f8(c19), f8(c18)), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)), f9(f8(f3(c19)), f8(f3(c18))))
% 0.21/0.57 = { by axiom 6 (p6_9) R->L }
% 0.21/0.57 fresh4(fresh(p6(f8(f3(c19)), f8(c19)), true, f8(f3(c19)), f8(f3(c18)), f8(c19), f8(c18)), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)), f9(f8(f3(c19)), f8(f3(c18))))
% 0.21/0.57 = { by axiom 14 (p6_33) R->L }
% 0.21/0.57 fresh4(fresh2(p6(f8(f3(c18)), f8(c18)), true, f8(f3(c19)), f8(f3(c18)), f8(c19), f8(c18)), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)), f9(f8(f3(c19)), f8(f3(c18))))
% 0.21/0.57 = { by axiom 7 (p6_14) }
% 0.21/0.57 fresh4(fresh2(true, true, f8(f3(c19)), f8(f3(c18)), f8(c19), f8(c18)), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)), f9(f8(f3(c19)), f8(f3(c18))))
% 0.21/0.57 = { by axiom 12 (p6_33) }
% 0.21/0.57 fresh4(p6(f9(f8(f3(c19)), f8(f3(c18))), f9(f8(c19), f8(c18))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)), f9(f8(f3(c19)), f8(f3(c18))))
% 0.21/0.57 = { by axiom 11 (p6_23) }
% 0.21/0.57 fresh3(p6(f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 9 (p6_23) R->L }
% 0.21/0.57 fresh3(fresh4(true, true, f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 1 (p6_4) R->L }
% 0.21/0.57 fresh3(fresh4(p6(f8(f10(f3(c19), f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 11 (p6_23) }
% 0.21/0.57 fresh3(fresh3(p6(f8(f10(f3(c19), f3(c18))), f9(f8(f3(c19)), f8(f3(c18)))), true, f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 13 (p6_36) R->L }
% 0.21/0.57 fresh3(fresh3(fresh36(p15(f3(c18)), true, f3(c19), f3(c18)), true, f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 3 (f3_is_p15_2) }
% 0.21/0.57 fresh3(fresh3(fresh36(true, true, f3(c19), f3(c18)), true, f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 8 (p6_36) }
% 0.21/0.57 fresh3(fresh3(fresh37(p15(f3(c19)), true, f3(c19), f3(c18)), true, f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 2 (f3_is_p15_1) }
% 0.21/0.57 fresh3(fresh3(fresh37(true, true, f3(c19), f3(c18)), true, f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 4 (p6_36) }
% 0.21/0.57 fresh3(fresh3(true, true, f9(f8(f3(c19)), f8(f3(c18))), f8(f10(f3(c19), f3(c18)))), true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 5 (p6_23) }
% 0.21/0.57 fresh3(true, true, f8(f10(f3(c19), f3(c18))), f9(f8(c19), f8(c18)))
% 0.21/0.57 = { by axiom 5 (p6_23) }
% 0.21/0.57 true
% 0.21/0.57 % SZS output end Proof
% 0.21/0.57
% 0.21/0.57 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------