%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN241-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 12.87s 2.03s
% Output   : Proof 12.87s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN241-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.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sat Aug 26 19:02:35 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 12.87/2.03  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 12.87/2.03  
% 12.87/2.03  % SZS status Unsatisfiable
% 12.87/2.03  
% 12.87/2.03  % SZS output start Proof
% 12.87/2.03  Take the following subset of the input axioms:
% 12.87/2.03    fof(axiom_1, axiom, s0(d)).
% 12.87/2.03    fof(axiom_20, axiom, l0(a)).
% 12.87/2.03    fof(prove_this, negated_conjecture, ![X]: ~m1(a, a, X)).
% 12.87/2.03    fof(rule_023, axiom, m1(a, a, a) | (~l0(a) | ~s0(d))).
% 12.87/2.03  
% 12.87/2.03  Now clausify the problem and encode Horn clauses using encoding 3 of
% 12.87/2.03  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 12.87/2.03  We repeatedly replace C & s=t => u=v by the two clauses:
% 12.87/2.03    fresh(y, y, x1...xn) = u
% 12.87/2.03    C => fresh(s, t, x1...xn) = v
% 12.87/2.03  where fresh is a fresh function symbol and x1..xn are the free
% 12.87/2.03  variables of u and v.
% 12.87/2.03  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 12.87/2.03  input problem has no model of domain size 1).
% 12.87/2.03  
% 12.87/2.03  The encoding turns the above axioms into the following unit equations and goals:
% 12.87/2.03  
% 12.87/2.03  Axiom 1 (axiom_1): s0(d) = true2.
% 12.87/2.03  Axiom 2 (axiom_20): l0(a) = true2.
% 12.87/2.03  Axiom 3 (rule_023): fresh411(X, X) = true2.
% 12.87/2.03  Axiom 4 (rule_023): fresh412(X, X) = m1(a, a, a).
% 12.87/2.03  Axiom 5 (rule_023): fresh412(l0(a), true2) = fresh411(s0(d), true2).
% 12.87/2.03  
% 12.87/2.03  Goal 1 (prove_this): m1(a, a, X) = true2.
% 12.87/2.03  The goal is true when:
% 12.87/2.03    X = a
% 12.87/2.03  
% 12.87/2.03  Proof:
% 12.87/2.03    m1(a, a, a)
% 12.87/2.03  = { by axiom 4 (rule_023) R->L }
% 12.87/2.03    fresh412(true2, true2)
% 12.87/2.03  = { by axiom 2 (axiom_20) R->L }
% 12.87/2.03    fresh412(l0(a), true2)
% 12.87/2.03  = { by axiom 5 (rule_023) }
% 12.87/2.03    fresh411(s0(d), true2)
% 12.87/2.03  = { by axiom 1 (axiom_1) }
% 12.87/2.03    fresh411(true2, true2)
% 12.87/2.03  = { by axiom 3 (rule_023) }
% 12.87/2.03    true2
% 12.87/2.03  % SZS output end Proof
% 12.87/2.03  
% 12.87/2.03  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------