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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN301-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 : n031.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:59 EDT 2023

% Result   : Unsatisfiable 27.26s 3.84s
% Output   : Proof 27.26s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN301-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.14  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.35  % Computer : n031.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sat Aug 26 20:00:23 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 27.26/3.84  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 27.26/3.84  
% 27.26/3.84  % SZS status Unsatisfiable
% 27.26/3.84  
% 27.26/3.84  % SZS output start Proof
% 27.26/3.84  Take the following subset of the input axioms:
% 27.26/3.85    fof(axiom_14, axiom, ![X]: p0(b, X)).
% 27.26/3.85    fof(axiom_37, axiom, n0(b, a)).
% 27.26/3.85    fof(axiom_9, axiom, r0(b)).
% 27.26/3.85    fof(prove_this, negated_conjecture, ~s4(a)).
% 27.26/3.85    fof(rule_002, axiom, ![G, H]: (l1(G, G) | ~n0(H, G))).
% 27.26/3.85    fof(rule_075, axiom, p1(a, a, a) | ~p0(b, a)).
% 27.26/3.85    fof(rule_087, axiom, p1(a, b, a) | (~r0(b) | ~p1(a, a, a))).
% 27.26/3.85    fof(rule_137, axiom, ![C, B, A2]: (n2(A2) | ~p1(B, C, A2))).
% 27.26/3.85    fof(rule_244, axiom, ![H2]: (p3(H2, H2, H2) | ~n2(H2))).
% 27.26/3.85    fof(rule_299, axiom, ![D, C2, B2, A2_2]: (s4(A2_2) | (~p3(B2, C2, D) | ~l1(A2_2, C2)))).
% 27.26/3.85  
% 27.26/3.85  Now clausify the problem and encode Horn clauses using encoding 3 of
% 27.26/3.85  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 27.26/3.85  We repeatedly replace C & s=t => u=v by the two clauses:
% 27.26/3.85    fresh(y, y, x1...xn) = u
% 27.26/3.85    C => fresh(s, t, x1...xn) = v
% 27.26/3.85  where fresh is a fresh function symbol and x1..xn are the free
% 27.26/3.85  variables of u and v.
% 27.26/3.85  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 27.26/3.85  input problem has no model of domain size 1).
% 27.26/3.85  
% 27.26/3.85  The encoding turns the above axioms into the following unit equations and goals:
% 27.26/3.85  
% 27.26/3.85  Axiom 1 (axiom_14): p0(b, X) = true.
% 27.26/3.85  Axiom 2 (axiom_9): r0(b) = true.
% 27.26/3.85  Axiom 3 (axiom_37): n0(b, a) = true.
% 27.26/3.85  Axiom 4 (rule_075): fresh341(X, X) = true.
% 27.26/3.85  Axiom 5 (rule_087): fresh324(X, X) = true.
% 27.26/3.85  Axiom 6 (rule_087): fresh325(X, X) = p1(a, b, a).
% 27.26/3.85  Axiom 7 (rule_002): fresh441(X, X, Y) = true.
% 27.26/3.85  Axiom 8 (rule_075): fresh341(p0(b, a), true) = p1(a, a, a).
% 27.26/3.85  Axiom 9 (rule_137): fresh262(X, X, Y) = true.
% 27.26/3.85  Axiom 10 (rule_244): fresh121(X, X, Y) = true.
% 27.26/3.85  Axiom 11 (rule_299): fresh45(X, X, Y) = true.
% 27.26/3.85  Axiom 12 (rule_002): fresh441(n0(X, Y), true, Y) = l1(Y, Y).
% 27.26/3.85  Axiom 13 (rule_087): fresh325(p1(a, a, a), true) = fresh324(r0(b), true).
% 27.26/3.85  Axiom 14 (rule_244): fresh121(n2(X), true, X) = p3(X, X, X).
% 27.26/3.85  Axiom 15 (rule_299): fresh46(X, X, Y, Z) = s4(Y).
% 27.26/3.85  Axiom 16 (rule_137): fresh262(p1(X, Y, Z), true, Z) = n2(Z).
% 27.26/3.85  Axiom 17 (rule_299): fresh46(p3(X, Y, Z), true, W, Y) = fresh45(l1(W, Y), true, W).
% 27.26/3.85  
% 27.26/3.85  Goal 1 (prove_this): s4(a) = true.
% 27.26/3.85  Proof:
% 27.26/3.85    s4(a)
% 27.26/3.85  = { by axiom 15 (rule_299) R->L }
% 27.26/3.85    fresh46(true, true, a, a)
% 27.26/3.85  = { by axiom 10 (rule_244) R->L }
% 27.26/3.85    fresh46(fresh121(true, true, a), true, a, a)
% 27.26/3.85  = { by axiom 9 (rule_137) R->L }
% 27.26/3.85    fresh46(fresh121(fresh262(true, true, a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 5 (rule_087) R->L }
% 27.26/3.85    fresh46(fresh121(fresh262(fresh324(true, true), true, a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 2 (axiom_9) R->L }
% 27.26/3.85    fresh46(fresh121(fresh262(fresh324(r0(b), true), true, a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 13 (rule_087) R->L }
% 27.26/3.85    fresh46(fresh121(fresh262(fresh325(p1(a, a, a), true), true, a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 8 (rule_075) R->L }
% 27.26/3.85    fresh46(fresh121(fresh262(fresh325(fresh341(p0(b, a), true), true), true, a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 1 (axiom_14) }
% 27.26/3.85    fresh46(fresh121(fresh262(fresh325(fresh341(true, true), true), true, a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 4 (rule_075) }
% 27.26/3.85    fresh46(fresh121(fresh262(fresh325(true, true), true, a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 6 (rule_087) }
% 27.26/3.85    fresh46(fresh121(fresh262(p1(a, b, a), true, a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 16 (rule_137) }
% 27.26/3.85    fresh46(fresh121(n2(a), true, a), true, a, a)
% 27.26/3.85  = { by axiom 14 (rule_244) }
% 27.26/3.85    fresh46(p3(a, a, a), true, a, a)
% 27.26/3.85  = { by axiom 17 (rule_299) }
% 27.26/3.85    fresh45(l1(a, a), true, a)
% 27.26/3.85  = { by axiom 12 (rule_002) R->L }
% 27.26/3.85    fresh45(fresh441(n0(b, a), true, a), true, a)
% 27.26/3.85  = { by axiom 3 (axiom_37) }
% 27.26/3.85    fresh45(fresh441(true, true, a), true, a)
% 27.26/3.85  = { by axiom 7 (rule_002) }
% 27.26/3.85    fresh45(true, true, a)
% 27.26/3.85  = { by axiom 11 (rule_299) }
% 27.26/3.85    true
% 27.26/3.85  % SZS output end Proof
% 27.26/3.85  
% 27.26/3.85  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------