%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL170-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 : n013.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:44 EDT 2023

% Result   : Unsatisfiable 0.20s 0.39s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL170-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.17/0.34  % Computer : n013.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Thu Aug 24 22:50:02 EDT 2023
% 0.17/0.35  % CPUTime  : 
% 0.20/0.39  Command-line arguments: --no-flatten-goal
% 0.20/0.39  
% 0.20/0.39  % SZS status Unsatisfiable
% 0.20/0.39  
% 0.20/0.39  % SZS output start Proof
% 0.20/0.39  Take the following subset of the input axioms:
% 0.20/0.39    fof(axiom_1_3, axiom, ![A, B]: axiom(or(not(A), or(B, A)))).
% 0.20/0.39    fof(prove_this, negated_conjecture, ~theorem(or(not(q), or(not(p), q)))).
% 0.20/0.39    fof(rule_1, axiom, ![X]: (theorem(X) | ~axiom(X))).
% 0.20/0.39  
% 0.20/0.39  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.39  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.39  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.39    fresh(y, y, x1...xn) = u
% 0.20/0.39    C => fresh(s, t, x1...xn) = v
% 0.20/0.39  where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.39  variables of u and v.
% 0.20/0.39  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.39  input problem has no model of domain size 1).
% 0.20/0.39  
% 0.20/0.39  The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.39  
% 0.20/0.39  Axiom 1 (rule_1): fresh4(X, X, Y) = true.
% 0.20/0.39  Axiom 2 (rule_1): fresh4(axiom(X), true, X) = theorem(X).
% 0.20/0.39  Axiom 3 (axiom_1_3): axiom(or(not(X), or(Y, X))) = true.
% 0.20/0.39  
% 0.20/0.39  Goal 1 (prove_this): theorem(or(not(q), or(not(p), q))) = true.
% 0.20/0.39  Proof:
% 0.20/0.39    theorem(or(not(q), or(not(p), q)))
% 0.20/0.39  = { by axiom 2 (rule_1) R->L }
% 0.20/0.39    fresh4(axiom(or(not(q), or(not(p), q))), true, or(not(q), or(not(p), q)))
% 0.20/0.39  = { by axiom 3 (axiom_1_3) }
% 0.20/0.39    fresh4(true, true, or(not(q), or(not(p), q)))
% 0.20/0.39  = { by axiom 1 (rule_1) }
% 0.20/0.39    true
% 0.20/0.39  % SZS output end Proof
% 0.20/0.39  
% 0.20/0.39  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------