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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL155-1 : TPTP v8.1.2. Released v1.0.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 : n016.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:41 EDT 2023

% Result   : Unsatisfiable 0.13s 0.42s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL155-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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 : n016.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 : Fri Aug 25 03:23:24 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.42  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.13/0.42  
% 0.13/0.42  % SZS status Unsatisfiable
% 0.13/0.42  
% 0.13/0.42  % SZS output start Proof
% 0.13/0.42  Axiom 1 (false_definition): not(truth) = falsehood.
% 0.13/0.42  Axiom 2 (and_star_commutativity): and_star(X, Y) = and_star(Y, X).
% 0.13/0.42  Axiom 3 (or_commutativity): or(X, Y) = or(Y, X).
% 0.13/0.42  Axiom 4 (wajsberg_1): implies(truth, X) = X.
% 0.13/0.42  Axiom 5 (or_definition): or(X, Y) = implies(not(X), Y).
% 0.13/0.42  Axiom 6 (and_star_definition): and_star(X, Y) = not(or(not(X), not(Y))).
% 0.13/0.42  Axiom 7 (and_definition): and(X, Y) = not(or(not(X), not(Y))).
% 0.13/0.42  Axiom 8 (xor_definition): xor(X, Y) = or(and(X, not(Y)), and(not(X), Y)).
% 0.13/0.42  Axiom 9 (wajsberg_4): implies(implies(not(X), not(Y)), implies(Y, X)) = truth.
% 0.13/0.42  Axiom 10 (wajsberg_2): implies(implies(X, Y), implies(implies(Y, Z), implies(X, Z))) = truth.
% 0.13/0.42  
% 0.13/0.42  Lemma 11: and(X, Y) = and_star(X, Y).
% 0.13/0.42  Proof:
% 0.13/0.42    and(X, Y)
% 0.13/0.42  = { by axiom 7 (and_definition) }
% 0.13/0.42    not(or(not(X), not(Y)))
% 0.13/0.42  = { by axiom 6 (and_star_definition) R->L }
% 0.13/0.42    and_star(X, Y)
% 0.13/0.42  
% 0.13/0.42  Lemma 12: or(X, not(X)) = truth.
% 0.13/0.42  Proof:
% 0.13/0.42    or(X, not(X))
% 0.13/0.42  = { by axiom 5 (or_definition) }
% 0.13/0.42    implies(not(X), not(X))
% 0.13/0.42  = { by axiom 4 (wajsberg_1) R->L }
% 0.13/0.42    implies(implies(truth, not(X)), not(X))
% 0.13/0.42  = { by axiom 4 (wajsberg_1) R->L }
% 0.13/0.42    implies(truth, implies(implies(truth, not(X)), not(X)))
% 0.13/0.42  = { by axiom 4 (wajsberg_1) R->L }
% 0.13/0.42    implies(truth, implies(implies(truth, not(X)), implies(truth, not(X))))
% 0.13/0.42  = { by axiom 4 (wajsberg_1) R->L }
% 0.13/0.42    implies(implies(truth, truth), implies(implies(truth, not(X)), implies(truth, not(X))))
% 0.13/0.42  = { by axiom 10 (wajsberg_2) }
% 0.13/0.42    truth
% 0.13/0.42  
% 0.13/0.42  Lemma 13: and_star(X, not(X)) = falsehood.
% 0.13/0.42  Proof:
% 0.13/0.42    and_star(X, not(X))
% 0.13/0.42  = { by axiom 6 (and_star_definition) }
% 0.13/0.42    not(or(not(X), not(not(X))))
% 0.13/0.42  = { by lemma 12 }
% 0.13/0.42    not(truth)
% 0.13/0.42  = { by axiom 1 (false_definition) }
% 0.13/0.42    falsehood
% 0.13/0.42  
% 0.13/0.42  Goal 1 (prove_alternative_wajsberg_axiom): xor(x, x) = falsehood.
% 0.13/0.42  Proof:
% 0.13/0.42    xor(x, x)
% 0.13/0.42  = { by axiom 8 (xor_definition) }
% 0.13/0.42    or(and(x, not(x)), and(not(x), x))
% 0.13/0.42  = { by lemma 11 }
% 0.13/0.42    or(and_star(x, not(x)), and(not(x), x))
% 0.13/0.42  = { by lemma 11 }
% 0.13/0.42    or(and_star(x, not(x)), and_star(not(x), x))
% 0.13/0.42  = { by lemma 13 }
% 0.13/0.42    or(falsehood, and_star(not(x), x))
% 0.13/0.42  = { by axiom 5 (or_definition) }
% 0.13/0.42    implies(not(falsehood), and_star(not(x), x))
% 0.13/0.42  = { by axiom 4 (wajsberg_1) R->L }
% 0.13/0.42    implies(implies(truth, not(falsehood)), and_star(not(x), x))
% 0.13/0.42  = { by lemma 12 R->L }
% 0.13/0.42    implies(implies(or(falsehood, not(falsehood)), not(falsehood)), and_star(not(x), x))
% 0.13/0.42  = { by axiom 3 (or_commutativity) R->L }
% 0.13/0.42    implies(implies(or(not(falsehood), falsehood), not(falsehood)), and_star(not(x), x))
% 0.13/0.42  = { by axiom 4 (wajsberg_1) R->L }
% 0.13/0.42    implies(implies(or(not(falsehood), falsehood), implies(truth, not(falsehood))), and_star(not(x), x))
% 0.13/0.42  = { by axiom 1 (false_definition) R->L }
% 0.13/0.42    implies(implies(or(not(falsehood), not(truth)), implies(truth, not(falsehood))), and_star(not(x), x))
% 0.13/0.42  = { by axiom 5 (or_definition) }
% 0.13/0.42    implies(implies(implies(not(not(falsehood)), not(truth)), implies(truth, not(falsehood))), and_star(not(x), x))
% 0.13/0.42  = { by axiom 9 (wajsberg_4) }
% 0.13/0.42    implies(truth, and_star(not(x), x))
% 0.13/0.42  = { by axiom 4 (wajsberg_1) }
% 0.13/0.42    and_star(not(x), x)
% 0.13/0.42  = { by axiom 2 (and_star_commutativity) }
% 0.13/0.42    and_star(x, not(x))
% 0.13/0.42  = { by lemma 13 }
% 0.13/0.42    falsehood
% 0.13/0.42  % SZS output end Proof
% 0.13/0.42  
% 0.13/0.42  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------