↑ Up

Twee---2.7.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : REL046-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:33:33 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : REL046-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.41  % Computer : n015.cluster.edu
% 0.14/0.41  % Model    : x86_64 x86_64
% 0.14/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41  % Memory   : 8046.5625MB
% 0.14/0.41  % OS       : Linux 6.8.0-71-generic
% 0.14/0.41  % CPULimit : 300
% 0.14/0.41  % WCLimit  : 300
% 0.14/0.41  % DateTime : Sun Sep 27 23:00:30 UTC 2026
% 0.14/0.42  % CPUTime  : 
% 0.14/0.42  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.60  Command-line arguments: --no-flatten-goal
% 0.20/0.60  
% 0.20/0.60  % SZS status Unsatisfiable
% 0.20/0.60  
% 0.20/0.62  % SZS output start Proof
% 0.20/0.62  Axiom 1 (def_zero_13): zero = meet(X, complement(X)).
% 0.20/0.62  Axiom 2 (converse_idempotence_8): converse(converse(X)) = X.
% 0.20/0.62  Axiom 3 (composition_identity_6): composition(X, one) = X.
% 0.20/0.62  Axiom 4 (maddux1_join_commutativity_1): join(X, Y) = join(Y, X).
% 0.20/0.62  Axiom 5 (def_top_12): top = join(X, complement(X)).
% 0.20/0.62  Axiom 6 (maddux4_definiton_of_meet_4): meet(X, Y) = complement(join(complement(X), complement(Y))).
% 0.20/0.62  Axiom 7 (converse_multiplicativity_10): converse(composition(X, Y)) = composition(converse(Y), converse(X)).
% 0.20/0.62  Axiom 8 (composition_associativity_5): composition(X, composition(Y, Z)) = composition(composition(X, Y), Z).
% 0.20/0.62  Axiom 9 (goals_14): join(sk1, meet(sk2, sk3)) = meet(sk2, sk3).
% 0.20/0.62  Axiom 10 (maddux2_join_associativity_2): join(X, join(Y, Z)) = join(join(X, Y), Z).
% 0.20/0.62  Axiom 11 (maddux3_a_kind_of_de_Morgan_3): X = join(complement(join(complement(X), complement(Y))), complement(join(complement(X), Y))).
% 0.20/0.62  Axiom 12 (converse_cancellativity_11): join(composition(converse(X), complement(composition(X, Y))), complement(Y)) = complement(Y).
% 0.20/0.62  
% 0.20/0.62  Lemma 13: complement(top) = zero.
% 0.20/0.62  Proof:
% 0.20/0.62    complement(top)
% 0.20/0.62  = { by axiom 5 (def_top_12) }
% 0.20/0.62    complement(join(complement(X), complement(complement(X))))
% 0.20/0.62  = { by axiom 6 (maddux4_definiton_of_meet_4) R->L }
% 0.20/0.63    meet(X, complement(X))
% 0.20/0.63  = { by axiom 1 (def_zero_13) R->L }
% 0.20/0.63    zero
% 0.20/0.63  
% 0.20/0.63  Lemma 14: join(meet(X, Y), complement(join(complement(X), Y))) = X.
% 0.20/0.63  Proof:
% 0.20/0.63    join(meet(X, Y), complement(join(complement(X), Y)))
% 0.20/0.63  = { by axiom 6 (maddux4_definiton_of_meet_4) }
% 0.20/0.63    join(complement(join(complement(X), complement(Y))), complement(join(complement(X), Y)))
% 0.20/0.63  = { by axiom 11 (maddux3_a_kind_of_de_Morgan_3) R->L }
% 0.20/0.63    X
% 0.20/0.63  
% 0.20/0.63  Lemma 15: join(meet(X, Y), meet(X, complement(Y))) = X.
% 0.20/0.63  Proof:
% 0.20/0.63    join(meet(X, Y), meet(X, complement(Y)))
% 0.20/0.63  = { by axiom 4 (maddux1_join_commutativity_1) R->L }
% 0.20/0.63    join(meet(X, complement(Y)), meet(X, Y))
% 0.20/0.63  = { by axiom 6 (maddux4_definiton_of_meet_4) }
% 0.20/0.63    join(meet(X, complement(Y)), complement(join(complement(X), complement(Y))))
% 0.20/0.63  = { by lemma 14 }
% 0.20/0.63    X
% 0.20/0.63  
% 0.20/0.63  Lemma 16: meet(Y, X) = meet(X, Y).
% 0.20/0.63  Proof:
% 0.20/0.63    meet(Y, X)
% 0.20/0.63  = { by axiom 6 (maddux4_definiton_of_meet_4) }
% 0.20/0.63    complement(join(complement(Y), complement(X)))
% 0.20/0.63  = { by axiom 4 (maddux1_join_commutativity_1) R->L }
% 0.20/0.63    complement(join(complement(X), complement(Y)))
% 0.20/0.63  = { by axiom 6 (maddux4_definiton_of_meet_4) R->L }
% 0.20/0.63    meet(X, Y)
% 0.20/0.63  
% 0.20/0.63  Lemma 17: complement(join(zero, complement(X))) = meet(X, top).
% 0.20/0.63  Proof:
% 0.20/0.63    complement(join(zero, complement(X)))
% 0.20/0.63  = { by lemma 13 R->L }
% 0.20/0.63    complement(join(complement(top), complement(X)))
% 0.20/0.63  = { by axiom 6 (maddux4_definiton_of_meet_4) R->L }
% 0.20/0.63    meet(top, X)
% 0.20/0.63  = { by lemma 16 R->L }
% 0.20/0.63    meet(X, top)
% 0.20/0.63  
% 0.20/0.63  Lemma 18: composition(converse(one), X) = X.
% 0.20/0.63  Proof:
% 0.20/0.63    composition(converse(one), X)
% 0.20/0.63  = { by axiom 2 (converse_idempotence_8) R->L }
% 0.20/0.63    composition(converse(one), converse(converse(X)))
% 0.20/0.63  = { by axiom 7 (converse_multiplicativity_10) R->L }
% 0.20/0.63    converse(composition(converse(X), one))
% 0.20/0.63  = { by axiom 3 (composition_identity_6) }
% 0.20/0.63    converse(converse(X))
% 0.20/0.63  = { by axiom 2 (converse_idempotence_8) }
% 0.20/0.63    X
% 0.20/0.63  
% 0.20/0.63  Lemma 19: join(complement(X), complement(X)) = complement(X).
% 0.20/0.63  Proof:
% 0.20/0.63    join(complement(X), complement(X))
% 0.20/0.63  = { by lemma 18 R->L }
% 0.20/0.63    join(complement(X), composition(converse(one), complement(X)))
% 0.20/0.63  = { by lemma 18 R->L }
% 0.20/0.63    join(complement(X), composition(converse(one), complement(composition(converse(one), X))))
% 0.20/0.63  = { by axiom 3 (composition_identity_6) R->L }
% 0.20/0.63    join(complement(X), composition(converse(one), complement(composition(composition(converse(one), one), X))))
% 0.20/0.63  = { by axiom 8 (composition_associativity_5) R->L }
% 0.20/0.63    join(complement(X), composition(converse(one), complement(composition(converse(one), composition(one, X)))))
% 0.20/0.63  = { by lemma 18 }
% 0.20/0.63    join(complement(X), composition(converse(one), complement(composition(one, X))))
% 0.20/0.63  = { by axiom 4 (maddux1_join_commutativity_1) R->L }
% 0.20/0.63    join(composition(converse(one), complement(composition(one, X))), complement(X))
% 0.20/0.63  = { by axiom 12 (converse_cancellativity_11) }
% 0.20/0.63    complement(X)
% 0.20/0.63  
% 0.20/0.63  Lemma 20: meet(top, complement(X)) = complement(X).
% 0.20/0.63  Proof:
% 0.20/0.63    meet(top, complement(X))
% 0.20/0.63  = { by lemma 16 }
% 0.20/0.63    meet(complement(X), top)
% 0.20/0.63  = { by lemma 17 R->L }
% 0.20/0.63    complement(join(zero, complement(complement(X))))
% 0.20/0.63  = { by axiom 1 (def_zero_13) }
% 0.20/0.63    complement(join(meet(X, complement(X)), complement(complement(X))))
% 0.20/0.63  = { by lemma 19 R->L }
% 0.20/0.63    complement(join(meet(X, complement(X)), complement(join(complement(X), complement(X)))))
% 0.20/0.63  = { by lemma 14 }
% 0.20/0.63    complement(X)
% 0.20/0.63  
% 0.20/0.63  Lemma 21: complement(zero) = top.
% 0.20/0.63  Proof:
% 0.20/0.63    complement(zero)
% 0.20/0.63  = { by lemma 15 R->L }
% 0.20/0.63    join(meet(complement(zero), top), meet(complement(zero), complement(top)))
% 0.20/0.63  = { by lemma 13 }
% 0.20/0.63    join(meet(complement(zero), top), meet(complement(zero), zero))
% 0.20/0.63  = { by lemma 16 R->L }
% 0.20/0.63    join(meet(complement(zero), top), meet(zero, complement(zero)))
% 0.20/0.63  = { by axiom 1 (def_zero_13) R->L }
% 0.20/0.63    join(meet(complement(zero), top), zero)
% 0.20/0.63  = { by axiom 4 (maddux1_join_commutativity_1) }
% 0.20/0.63    join(zero, meet(complement(zero), top))
% 0.20/0.63  = { by lemma 16 R->L }
% 0.20/0.63    join(zero, meet(top, complement(zero)))
% 0.20/0.63  = { by lemma 20 }
% 0.20/0.63    join(zero, complement(zero))
% 0.20/0.63  = { by axiom 5 (def_top_12) R->L }
% 0.20/0.63    top
% 0.20/0.63  
% 0.20/0.63  Lemma 22: join(zero, meet(X, top)) = X.
% 0.20/0.63  Proof:
% 0.20/0.63    join(zero, meet(X, top))
% 0.20/0.63  = { by lemma 21 R->L }
% 0.20/0.63    join(zero, meet(X, complement(zero)))
% 0.20/0.63  = { by lemma 13 R->L }
% 0.20/0.63    join(complement(top), meet(X, complement(zero)))
% 1.13/0.64  = { by axiom 5 (def_top_12) }
% 1.13/0.64    join(complement(join(X, complement(X))), meet(X, complement(zero)))
% 1.13/0.64  = { by lemma 19 R->L }
% 1.13/0.64    join(complement(join(X, join(complement(X), complement(X)))), meet(X, complement(zero)))
% 1.13/0.64  = { by axiom 10 (maddux2_join_associativity_2) }
% 1.13/0.64    join(complement(join(join(X, complement(X)), complement(X))), meet(X, complement(zero)))
% 1.13/0.64  = { by axiom 5 (def_top_12) R->L }
% 1.13/0.64    join(complement(join(top, complement(X))), meet(X, complement(zero)))
% 1.13/0.64  = { by lemma 21 R->L }
% 1.13/0.64    join(complement(join(complement(zero), complement(X))), meet(X, complement(zero)))
% 1.13/0.64  = { by axiom 6 (maddux4_definiton_of_meet_4) R->L }
% 1.13/0.64    join(meet(zero, X), meet(X, complement(zero)))
% 1.13/0.64  = { by lemma 16 R->L }
% 1.13/0.64    join(meet(X, zero), meet(X, complement(zero)))
% 1.13/0.64  = { by lemma 15 }
% 1.13/0.64    X
% 1.13/0.64  
% 1.13/0.64  Lemma 23: meet(X, top) = X.
% 1.13/0.64  Proof:
% 1.13/0.64    meet(X, top)
% 1.13/0.64  = { by lemma 17 R->L }
% 1.13/0.64    complement(join(zero, complement(X)))
% 1.13/0.64  = { by lemma 22 R->L }
% 1.13/0.64    join(zero, meet(complement(join(zero, complement(X))), top))
% 1.13/0.64  = { by lemma 16 R->L }
% 1.13/0.64    join(zero, meet(top, complement(join(zero, complement(X)))))
% 1.13/0.64  = { by lemma 20 }
% 1.13/0.64    join(zero, complement(join(zero, complement(X))))
% 1.13/0.64  = { by lemma 17 }
% 1.13/0.64    join(zero, meet(X, top))
% 1.13/0.64  = { by lemma 22 }
% 1.13/0.64    X
% 1.13/0.64  
% 1.13/0.64  Lemma 24: join(X, meet(X, Y)) = X.
% 1.13/0.64  Proof:
% 1.13/0.64    join(X, meet(X, Y))
% 1.13/0.64  = { by axiom 4 (maddux1_join_commutativity_1) R->L }
% 1.13/0.64    join(meet(X, Y), X)
% 1.13/0.64  = { by lemma 14 R->L }
% 1.13/0.64    join(meet(X, Y), join(meet(X, Y), complement(join(complement(X), Y))))
% 1.13/0.64  = { by axiom 4 (maddux1_join_commutativity_1) R->L }
% 1.13/0.64    join(meet(X, Y), join(complement(join(complement(X), Y)), meet(X, Y)))
% 1.13/0.64  = { by lemma 23 R->L }
% 1.13/0.64    join(meet(X, Y), join(complement(join(complement(X), Y)), meet(meet(X, Y), top)))
% 1.13/0.64  = { by lemma 17 R->L }
% 1.13/0.64    join(meet(X, Y), join(complement(join(complement(X), Y)), complement(join(zero, complement(meet(X, Y))))))
% 1.13/0.64  = { by lemma 23 R->L }
% 1.13/0.64    join(meet(meet(X, Y), top), join(complement(join(complement(X), Y)), complement(join(zero, complement(meet(X, Y))))))
% 1.13/0.64  = { by lemma 17 R->L }
% 1.13/0.64    join(complement(join(zero, complement(meet(X, Y)))), join(complement(join(complement(X), Y)), complement(join(zero, complement(meet(X, Y))))))
% 1.13/0.64  = { by axiom 4 (maddux1_join_commutativity_1) R->L }
% 1.13/0.64    join(complement(join(zero, complement(meet(X, Y)))), join(complement(join(zero, complement(meet(X, Y)))), complement(join(complement(X), Y))))
% 1.13/0.64  = { by axiom 10 (maddux2_join_associativity_2) }
% 1.13/0.64    join(join(complement(join(zero, complement(meet(X, Y)))), complement(join(zero, complement(meet(X, Y))))), complement(join(complement(X), Y)))
% 1.13/0.64  = { by lemma 19 }
% 1.13/0.64    join(complement(join(zero, complement(meet(X, Y)))), complement(join(complement(X), Y)))
% 1.13/0.64  = { by axiom 4 (maddux1_join_commutativity_1) }
% 1.13/0.64    join(complement(join(complement(X), Y)), complement(join(zero, complement(meet(X, Y)))))
% 1.13/0.64  = { by lemma 17 }
% 1.13/0.64    join(complement(join(complement(X), Y)), meet(meet(X, Y), top))
% 1.13/0.64  = { by lemma 23 }
% 1.13/0.64    join(complement(join(complement(X), Y)), meet(X, Y))
% 1.13/0.64  = { by axiom 4 (maddux1_join_commutativity_1) }
% 1.13/0.64    join(meet(X, Y), complement(join(complement(X), Y)))
% 1.13/0.64  = { by lemma 14 }
% 1.13/0.64    X
% 1.13/0.64  
% 1.13/0.64  Lemma 25: join(X, meet(Y, X)) = X.
% 1.13/0.64  Proof:
% 1.13/0.64    join(X, meet(Y, X))
% 1.13/0.64  = { by lemma 16 }
% 1.13/0.64    join(X, meet(X, Y))
% 1.13/0.64  = { by lemma 24 }
% 1.13/0.64    X
% 1.13/0.64  
% 1.13/0.64  Lemma 26: join(sk1, join(X, meet(sk2, sk3))) = join(X, meet(sk2, sk3)).
% 1.13/0.64  Proof:
% 1.13/0.64    join(sk1, join(X, meet(sk2, sk3)))
% 1.13/0.64  = { by axiom 4 (maddux1_join_commutativity_1) R->L }
% 1.13/0.64    join(sk1, join(meet(sk2, sk3), X))
% 1.13/0.64  = { by axiom 10 (maddux2_join_associativity_2) }
% 1.13/0.64    join(join(sk1, meet(sk2, sk3)), X)
% 1.13/0.64  = { by axiom 9 (goals_14) }
% 1.13/0.64    join(meet(sk2, sk3), X)
% 1.13/0.64  = { by axiom 4 (maddux1_join_commutativity_1) }
% 1.13/0.64    join(X, meet(sk2, sk3))
% 1.13/0.64  
% 1.13/0.64  Goal 1 (goals_15): tuple(join(sk1, sk2), join(sk1, sk3)) = tuple(sk2, sk3).
% 1.13/0.64  Proof:
% 1.13/0.64    tuple(join(sk1, sk2), join(sk1, sk3))
% 1.13/0.64  = { by lemma 24 R->L }
% 1.13/0.64    tuple(join(sk1, join(sk2, meet(sk2, sk3))), join(sk1, sk3))
% 1.13/0.64  = { by lemma 26 }
% 1.13/0.64    tuple(join(sk2, meet(sk2, sk3)), join(sk1, sk3))
% 1.13/0.64  = { by lemma 24 }
% 1.13/0.64    tuple(sk2, join(sk1, sk3))
% 1.13/0.64  = { by lemma 25 R->L }
% 1.13/0.64    tuple(sk2, join(sk1, join(sk3, meet(sk2, sk3))))
% 1.13/0.64  = { by lemma 26 }
% 1.13/0.64    tuple(sk2, join(sk3, meet(sk2, sk3)))
% 1.13/0.64  = { by lemma 25 }
% 1.13/0.64    tuple(sk2, sk3)
% 1.13/0.64  % SZS output end Proof
% 1.13/0.64  
% 1.13/0.64  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------