TSTP Solution File: SYN211-1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN211-1 : TPTP v8.1.2. Released v1.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 : n010.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:33:37 EDT 2023

% Result   : Unsatisfiable 28.63s 4.07s
% Output   : Proof 29.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : SYN211-1 : TPTP v8.1.2. Released v1.1.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.14/0.34  % Computer : n010.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 20:31:04 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 28.63/4.07  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 28.63/4.07  
% 28.63/4.07  % SZS status Unsatisfiable
% 28.63/4.07  
% 28.63/4.08  % SZS output start Proof
% 28.63/4.08  Take the following subset of the input axioms:
% 28.63/4.08    fof(axiom_17, axiom, ![X]: q0(X, d)).
% 28.63/4.08    fof(axiom_19, axiom, ![Y, X2]: m0(X2, d, Y)).
% 28.63/4.08    fof(axiom_34, axiom, n0(c, d)).
% 28.63/4.08    fof(prove_this, negated_conjecture, ~s4(d)).
% 28.63/4.08    fof(rule_002, axiom, ![G, H]: (l1(G, G) | ~n0(H, G))).
% 28.63/4.08    fof(rule_107, axiom, ![A2]: (q1(e, A2, A2) | (~m0(A2, d, A2) | ~m0(e, d, A2)))).
% 28.63/4.08    fof(rule_129, axiom, ![J, A]: (k2(J, J) | ~q1(A, J, J))).
% 28.63/4.08    fof(rule_252, axiom, ![I, J2, H2]: (p3(H2, H2, H2) | (~q0(I, H2) | ~k2(J2, J2)))).
% 28.63/4.08    fof(rule_299, axiom, ![C, D, B, A2_2]: (s4(A2_2) | (~p3(B, C, D) | ~l1(A2_2, C)))).
% 28.63/4.08  
% 28.63/4.08  Now clausify the problem and encode Horn clauses using encoding 3 of
% 28.63/4.08  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 28.63/4.08  We repeatedly replace C & s=t => u=v by the two clauses:
% 28.63/4.08    fresh(y, y, x1...xn) = u
% 28.63/4.08    C => fresh(s, t, x1...xn) = v
% 28.63/4.08  where fresh is a fresh function symbol and x1..xn are the free
% 28.63/4.08  variables of u and v.
% 28.63/4.08  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 28.63/4.08  input problem has no model of domain size 1).
% 28.63/4.08  
% 28.63/4.08  The encoding turns the above axioms into the following unit equations and goals:
% 28.63/4.08  
% 28.63/4.08  Axiom 1 (axiom_17): q0(X, d) = true.
% 28.63/4.08  Axiom 2 (axiom_34): n0(c, d) = true.
% 28.63/4.08  Axiom 3 (axiom_19): m0(X, d, Y) = true.
% 28.63/4.08  Axiom 4 (rule_002): fresh441(X, X, Y) = true.
% 28.63/4.08  Axiom 5 (rule_107): fresh301(X, X, Y) = q1(e, Y, Y).
% 28.63/4.08  Axiom 6 (rule_107): fresh300(X, X, Y) = true.
% 28.63/4.08  Axiom 7 (rule_129): fresh270(X, X, Y) = true.
% 28.63/4.08  Axiom 8 (rule_252): fresh108(X, X, Y) = true.
% 28.63/4.08  Axiom 9 (rule_299): fresh45(X, X, Y) = true.
% 28.63/4.08  Axiom 10 (rule_252): fresh109(X, X, Y, Z) = p3(Y, Y, Y).
% 28.63/4.08  Axiom 11 (rule_299): fresh46(X, X, Y, Z) = s4(Y).
% 28.63/4.08  Axiom 12 (rule_002): fresh441(n0(X, Y), true, Y) = l1(Y, Y).
% 28.63/4.08  Axiom 13 (rule_107): fresh301(m0(e, d, X), true, X) = fresh300(m0(X, d, X), true, X).
% 28.63/4.08  Axiom 14 (rule_129): fresh270(q1(X, Y, Y), true, Y) = k2(Y, Y).
% 28.63/4.08  Axiom 15 (rule_252): fresh109(k2(X, X), true, Y, Z) = fresh108(q0(Z, Y), true, Y).
% 28.63/4.08  Axiom 16 (rule_299): fresh46(p3(X, Y, Z), true, W, Y) = fresh45(l1(W, Y), true, W).
% 28.63/4.08  
% 28.63/4.08  Goal 1 (prove_this): s4(d) = true.
% 29.17/4.08  Proof:
% 29.17/4.08    s4(d)
% 29.17/4.08  = { by axiom 11 (rule_299) R->L }
% 29.17/4.08    fresh46(true, true, d, d)
% 29.17/4.08  = { by axiom 8 (rule_252) R->L }
% 29.17/4.08    fresh46(fresh108(true, true, d), true, d, d)
% 29.17/4.08  = { by axiom 1 (axiom_17) R->L }
% 29.17/4.08    fresh46(fresh108(q0(X, d), true, d), true, d, d)
% 29.17/4.08  = { by axiom 15 (rule_252) R->L }
% 29.17/4.08    fresh46(fresh109(k2(Y, Y), true, d, X), true, d, d)
% 29.17/4.08  = { by axiom 14 (rule_129) R->L }
% 29.17/4.08    fresh46(fresh109(fresh270(q1(e, Y, Y), true, Y), true, d, X), true, d, d)
% 29.17/4.08  = { by axiom 5 (rule_107) R->L }
% 29.17/4.08    fresh46(fresh109(fresh270(fresh301(true, true, Y), true, Y), true, d, X), true, d, d)
% 29.17/4.08  = { by axiom 3 (axiom_19) R->L }
% 29.17/4.08    fresh46(fresh109(fresh270(fresh301(m0(e, d, Y), true, Y), true, Y), true, d, X), true, d, d)
% 29.17/4.08  = { by axiom 13 (rule_107) }
% 29.17/4.08    fresh46(fresh109(fresh270(fresh300(m0(Y, d, Y), true, Y), true, Y), true, d, X), true, d, d)
% 29.17/4.08  = { by axiom 3 (axiom_19) }
% 29.17/4.08    fresh46(fresh109(fresh270(fresh300(true, true, Y), true, Y), true, d, X), true, d, d)
% 29.17/4.08  = { by axiom 6 (rule_107) }
% 29.17/4.08    fresh46(fresh109(fresh270(true, true, Y), true, d, X), true, d, d)
% 29.17/4.08  = { by axiom 7 (rule_129) }
% 29.17/4.08    fresh46(fresh109(true, true, d, X), true, d, d)
% 29.17/4.08  = { by axiom 10 (rule_252) }
% 29.17/4.08    fresh46(p3(d, d, d), true, d, d)
% 29.17/4.08  = { by axiom 16 (rule_299) }
% 29.17/4.08    fresh45(l1(d, d), true, d)
% 29.17/4.08  = { by axiom 12 (rule_002) R->L }
% 29.17/4.08    fresh45(fresh441(n0(c, d), true, d), true, d)
% 29.17/4.08  = { by axiom 2 (axiom_34) }
% 29.17/4.08    fresh45(fresh441(true, true, d), true, d)
% 29.17/4.08  = { by axiom 4 (rule_002) }
% 29.17/4.08    fresh45(true, true, d)
% 29.17/4.08  = { by axiom 9 (rule_299) }
% 29.17/4.08    true
% 29.17/4.08  % SZS output end Proof
% 29.17/4.08  
% 29.17/4.08  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------