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

% Result   : Unsatisfiable 11.98s 2.35s
% Output   : Proof 11.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN240-1 : TPTP v8.1.2. Released v1.1.0.
% 0.14/0.15  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.14/0.36  % Computer : n027.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Sat Aug 26 21:39:05 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 11.98/2.35  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 11.98/2.35  
% 11.98/2.35  % SZS status Unsatisfiable
% 11.98/2.35  
% 11.98/2.35  % SZS output start Proof
% 11.98/2.35  Take the following subset of the input axioms:
% 11.98/2.35    fof(axiom_13, axiom, r0(e)).
% 11.98/2.35    fof(prove_this, negated_conjecture, ![X]: ~m1(X, e, e)).
% 11.98/2.35    fof(rule_012, axiom, m1(e, e, e) | ~r0(e)).
% 11.98/2.35  
% 11.98/2.35  Now clausify the problem and encode Horn clauses using encoding 3 of
% 11.98/2.35  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 11.98/2.35  We repeatedly replace C & s=t => u=v by the two clauses:
% 11.98/2.35    fresh(y, y, x1...xn) = u
% 11.98/2.35    C => fresh(s, t, x1...xn) = v
% 11.98/2.35  where fresh is a fresh function symbol and x1..xn are the free
% 11.98/2.35  variables of u and v.
% 11.98/2.35  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 11.98/2.35  input problem has no model of domain size 1).
% 11.98/2.35  
% 11.98/2.35  The encoding turns the above axioms into the following unit equations and goals:
% 11.98/2.35  
% 11.98/2.35  Axiom 1 (axiom_13): r0(e) = true2.
% 11.98/2.35  Axiom 2 (rule_012): fresh428(X, X) = true2.
% 11.98/2.35  Axiom 3 (rule_012): fresh428(r0(e), true2) = m1(e, e, e).
% 11.98/2.35  
% 11.98/2.35  Goal 1 (prove_this): m1(X, e, e) = true2.
% 11.98/2.35  The goal is true when:
% 11.98/2.35    X = e
% 11.98/2.35  
% 11.98/2.35  Proof:
% 11.98/2.35    m1(e, e, e)
% 11.98/2.35  = { by axiom 3 (rule_012) R->L }
% 11.98/2.35    fresh428(r0(e), true2)
% 11.98/2.35  = { by axiom 1 (axiom_13) }
% 11.98/2.35    fresh428(true2, true2)
% 11.98/2.35  = { by axiom 2 (rule_012) }
% 11.98/2.35    true2
% 11.98/2.35  % SZS output end Proof
% 11.98/2.35  
% 11.98/2.35  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------