TSTP Solution File: LCL197-3 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL197-3 : TPTP v8.1.2. Released v2.3.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 : n015.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 : Thu Aug 31 08:17:56 EDT 2023

% Result   : Unsatisfiable 14.46s 2.20s
% Output   : Proof 14.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : LCL197-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.11  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.10/0.32  % Computer : n015.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Thu Aug 24 18:52:21 EDT 2023
% 0.10/0.32  % CPUTime  : 
% 14.46/2.20  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 14.46/2.20  
% 14.46/2.20  % SZS status Unsatisfiable
% 14.46/2.20  
% 14.46/2.21  % SZS output start Proof
% 14.46/2.21  Take the following subset of the input axioms:
% 14.46/2.21    fof(axiom_1_2, axiom, ![A]: axiom(implies(or(A, A), A))).
% 14.46/2.21    fof(axiom_1_5, axiom, ![B, C, A2]: axiom(implies(or(A2, or(B, C)), or(B, or(A2, C))))).
% 14.46/2.21    fof(axiom_1_6, axiom, ![A2, B2, C2]: axiom(implies(implies(A2, B2), implies(or(C2, A2), or(C2, B2))))).
% 14.46/2.21    fof(implies_definition, axiom, ![X, Y]: implies(X, Y)=or(not(X), Y)).
% 14.46/2.21    fof(prove_this, negated_conjecture, ~theorem(implies(or(q, or(p, q)), or(p, q)))).
% 14.46/2.21    fof(rule_1, axiom, ![X2]: (theorem(X2) | ~axiom(X2))).
% 14.46/2.21    fof(rule_2, axiom, ![X2, Y2]: (theorem(X2) | (~theorem(implies(Y2, X2)) | ~theorem(Y2)))).
% 14.46/2.21  
% 14.46/2.21  Now clausify the problem and encode Horn clauses using encoding 3 of
% 14.46/2.21  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 14.46/2.21  We repeatedly replace C & s=t => u=v by the two clauses:
% 14.46/2.21    fresh(y, y, x1...xn) = u
% 14.46/2.21    C => fresh(s, t, x1...xn) = v
% 14.46/2.21  where fresh is a fresh function symbol and x1..xn are the free
% 14.46/2.21  variables of u and v.
% 14.46/2.21  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 14.46/2.21  input problem has no model of domain size 1).
% 14.46/2.21  
% 14.46/2.21  The encoding turns the above axioms into the following unit equations and goals:
% 14.46/2.21  
% 14.46/2.21  Axiom 1 (implies_definition): implies(X, Y) = or(not(X), Y).
% 14.46/2.21  Axiom 2 (rule_2): fresh(X, X, Y) = true.
% 14.46/2.21  Axiom 3 (rule_1): fresh2(X, X, Y) = true.
% 14.46/2.21  Axiom 4 (rule_2): fresh3(X, X, Y, Z) = theorem(Y).
% 14.46/2.21  Axiom 5 (rule_1): fresh2(axiom(X), true, X) = theorem(X).
% 14.46/2.21  Axiom 6 (axiom_1_2): axiom(implies(or(X, X), X)) = true.
% 14.46/2.21  Axiom 7 (rule_2): fresh3(theorem(implies(X, Y)), true, Y, X) = fresh(theorem(X), true, Y).
% 14.46/2.21  Axiom 8 (axiom_1_6): axiom(implies(implies(X, Y), implies(or(Z, X), or(Z, Y)))) = true.
% 14.46/2.21  Axiom 9 (axiom_1_5): axiom(implies(or(X, or(Y, Z)), or(Y, or(X, Z)))) = true.
% 14.46/2.21  
% 14.46/2.21  Goal 1 (prove_this): theorem(implies(or(q, or(p, q)), or(p, q))) = true.
% 14.46/2.21  Proof:
% 14.46/2.21    theorem(implies(or(q, or(p, q)), or(p, q)))
% 14.46/2.21  = { by axiom 4 (rule_2) R->L }
% 14.46/2.21    fresh3(true, true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.21  = { by axiom 2 (rule_2) R->L }
% 14.46/2.21    fresh3(fresh(true, true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.21  = { by axiom 2 (rule_2) R->L }
% 14.46/2.21    fresh3(fresh(fresh(true, true, implies(or(p, or(q, q)), or(p, q))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.21  = { by axiom 3 (rule_1) R->L }
% 14.46/2.21    fresh3(fresh(fresh(fresh2(true, true, implies(or(q, q), q)), true, implies(or(p, or(q, q)), or(p, q))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.21  = { by axiom 6 (axiom_1_2) R->L }
% 14.46/2.21    fresh3(fresh(fresh(fresh2(axiom(implies(or(q, q), q)), true, implies(or(q, q), q)), true, implies(or(p, or(q, q)), or(p, q))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.21  = { by axiom 5 (rule_1) }
% 14.46/2.21    fresh3(fresh(fresh(theorem(implies(or(q, q), q)), true, implies(or(p, or(q, q)), or(p, q))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.21  = { by axiom 7 (rule_2) R->L }
% 14.46/2.21    fresh3(fresh(fresh3(theorem(implies(implies(or(q, q), q), implies(or(p, or(q, q)), or(p, q)))), true, implies(or(p, or(q, q)), or(p, q)), implies(or(q, q), q)), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.21  = { by axiom 5 (rule_1) R->L }
% 14.46/2.21    fresh3(fresh(fresh3(fresh2(axiom(implies(implies(or(q, q), q), implies(or(p, or(q, q)), or(p, q)))), true, implies(implies(or(q, q), q), implies(or(p, or(q, q)), or(p, q)))), true, implies(or(p, or(q, q)), or(p, q)), implies(or(q, q), q)), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.21  = { by axiom 8 (axiom_1_6) }
% 14.46/2.22    fresh3(fresh(fresh3(fresh2(true, true, implies(implies(or(q, q), q), implies(or(p, or(q, q)), or(p, q)))), true, implies(or(p, or(q, q)), or(p, q)), implies(or(q, q), q)), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 3 (rule_1) }
% 14.46/2.22    fresh3(fresh(fresh3(true, true, implies(or(p, or(q, q)), or(p, q)), implies(or(q, q), q)), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 4 (rule_2) }
% 14.46/2.22    fresh3(fresh(theorem(implies(or(p, or(q, q)), or(p, q))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 7 (rule_2) R->L }
% 14.46/2.22    fresh3(fresh3(theorem(implies(implies(or(p, or(q, q)), or(p, q)), implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))), implies(or(p, or(q, q)), or(p, q))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 5 (rule_1) R->L }
% 14.46/2.22    fresh3(fresh3(fresh2(axiom(implies(implies(or(p, or(q, q)), or(p, q)), implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))))), true, implies(implies(or(p, or(q, q)), or(p, q)), implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))), implies(or(p, or(q, q)), or(p, q))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 1 (implies_definition) }
% 14.46/2.22    fresh3(fresh3(fresh2(axiom(implies(implies(or(p, or(q, q)), or(p, q)), implies(implies(or(q, or(p, q)), or(p, or(q, q))), or(not(or(q, or(p, q))), or(p, q))))), true, implies(implies(or(p, or(q, q)), or(p, q)), implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))), implies(or(p, or(q, q)), or(p, q))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 1 (implies_definition) }
% 14.46/2.22    fresh3(fresh3(fresh2(axiom(implies(implies(or(p, or(q, q)), or(p, q)), implies(or(not(or(q, or(p, q))), or(p, or(q, q))), or(not(or(q, or(p, q))), or(p, q))))), true, implies(implies(or(p, or(q, q)), or(p, q)), implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))), implies(or(p, or(q, q)), or(p, q))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 8 (axiom_1_6) }
% 14.46/2.22    fresh3(fresh3(fresh2(true, true, implies(implies(or(p, or(q, q)), or(p, q)), implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))))), true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))), implies(or(p, or(q, q)), or(p, q))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 3 (rule_1) }
% 14.46/2.22    fresh3(fresh3(true, true, implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q))), implies(or(p, or(q, q)), or(p, q))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 4 (rule_2) }
% 14.46/2.22    fresh3(theorem(implies(implies(or(q, or(p, q)), or(p, or(q, q))), implies(or(q, or(p, q)), or(p, q)))), true, implies(or(q, or(p, q)), or(p, q)), implies(or(q, or(p, q)), or(p, or(q, q))))
% 14.46/2.22  = { by axiom 7 (rule_2) }
% 14.46/2.22    fresh(theorem(implies(or(q, or(p, q)), or(p, or(q, q)))), true, implies(or(q, or(p, q)), or(p, q)))
% 14.46/2.22  = { by axiom 5 (rule_1) R->L }
% 14.46/2.22    fresh(fresh2(axiom(implies(or(q, or(p, q)), or(p, or(q, q)))), true, implies(or(q, or(p, q)), or(p, or(q, q)))), true, implies(or(q, or(p, q)), or(p, q)))
% 14.46/2.22  = { by axiom 9 (axiom_1_5) }
% 14.46/2.22    fresh(fresh2(true, true, implies(or(q, or(p, q)), or(p, or(q, q)))), true, implies(or(q, or(p, q)), or(p, q)))
% 14.46/2.22  = { by axiom 3 (rule_1) }
% 14.46/2.22    fresh(true, true, implies(or(q, or(p, q)), or(p, q)))
% 14.46/2.22  = { by axiom 2 (rule_2) }
% 14.46/2.22    true
% 14.46/2.22  % SZS output end Proof
% 14.46/2.22  
% 14.46/2.22  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------