TSTP Solution File: ALG397-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : ALG397-1 : TPTP v8.1.2. Released v4.1.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 : Wed Aug 30 16:43:10 EDT 2023
% Result : Unsatisfiable 28.56s 4.11s
% Output : Proof 28.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : ALG397-1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.14 % 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 : Mon Aug 28 05:57:10 EDT 2023
% 0.14/0.35 % CPUTime :
% 28.56/4.11 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 28.56/4.11
% 28.56/4.11 % SZS status Unsatisfiable
% 28.56/4.11
% 28.56/4.12 % SZS output start Proof
% 28.56/4.12 Take the following subset of the input axioms:
% 28.56/4.12 fof(cls_CHAINED_0, axiom, ~c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____, tc_Complex_Ocomplex), tc_Complex_Ocomplex, tc_Complex_Ocomplex)).
% 28.56/4.12 fof(cls_conjecture_0, negated_conjecture, c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____, tc_Complex_Ocomplex), tc_Complex_Ocomplex, tc_Complex_Ocomplex)).
% 28.56/4.12
% 28.56/4.12 Now clausify the problem and encode Horn clauses using encoding 3 of
% 28.56/4.12 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 28.56/4.12 We repeatedly replace C & s=t => u=v by the two clauses:
% 28.56/4.12 fresh(y, y, x1...xn) = u
% 28.56/4.12 C => fresh(s, t, x1...xn) = v
% 28.56/4.12 where fresh is a fresh function symbol and x1..xn are the free
% 28.56/4.12 variables of u and v.
% 28.56/4.12 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 28.56/4.12 input problem has no model of domain size 1).
% 28.56/4.12
% 28.56/4.12 The encoding turns the above axioms into the following unit equations and goals:
% 28.56/4.12
% 28.56/4.12 Axiom 1 (cls_conjecture_0): c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____, tc_Complex_Ocomplex), tc_Complex_Ocomplex, tc_Complex_Ocomplex) = true2.
% 28.56/4.12
% 28.56/4.12 Goal 1 (cls_CHAINED_0): c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____, tc_Complex_Ocomplex), tc_Complex_Ocomplex, tc_Complex_Ocomplex) = true2.
% 28.56/4.12 Proof:
% 28.56/4.12 c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____, tc_Complex_Ocomplex), tc_Complex_Ocomplex, tc_Complex_Ocomplex)
% 28.56/4.12 = { by axiom 1 (cls_conjecture_0) }
% 28.56/4.12 true2
% 28.56/4.12 % SZS output end Proof
% 28.56/4.12
% 28.56/4.12 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------