TSTP Solution File: COL009-1 by Twee---2.5.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.5.0
% Problem : COL009-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee /export/starexec/sandbox2/benchmark/theBenchmark.p --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding
% Computer : n003.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 : Mon Jun 24 04:50:10 EDT 2024
% Result : Unsatisfiable 7.04s 1.26s
% Output : Proof 7.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL009-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.12 % Command : parallel-twee /export/starexec/sandbox2/benchmark/theBenchmark.p --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding
% 0.12/0.32 % Computer : n003.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Jun 18 16:27:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 7.04/1.26 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 7.04/1.26
% 7.04/1.26 % SZS status Unsatisfiable
% 7.04/1.26
% 7.04/1.26 % SZS output start Proof
% 7.04/1.26 Axiom 1 (l2_definition): apply(apply(l2, X), Y) = apply(Y, apply(X, X)).
% 7.04/1.26 Axiom 2 (b_definition): apply(apply(apply(b, X), Y), Z) = apply(X, apply(Y, Z)).
% 7.04/1.26
% 7.04/1.26 Goal 1 (prove_fixed_point): X = apply(combinator, X).
% 7.04/1.26 The goal is true when:
% 7.04/1.26 X = apply(apply(l2, apply(apply(b, apply(b, combinator)), l2)), apply(l2, apply(apply(b, apply(b, combinator)), l2)))
% 7.04/1.26
% 7.04/1.26 Proof:
% 7.04/1.26 apply(apply(l2, apply(apply(b, apply(b, combinator)), l2)), apply(l2, apply(apply(b, apply(b, combinator)), l2)))
% 7.04/1.26 = { by axiom 1 (l2_definition) }
% 7.04/1.26 apply(apply(l2, apply(apply(b, apply(b, combinator)), l2)), apply(apply(apply(b, apply(b, combinator)), l2), apply(apply(b, apply(b, combinator)), l2)))
% 7.04/1.26 = { by axiom 2 (b_definition) }
% 7.04/1.26 apply(apply(l2, apply(apply(b, apply(b, combinator)), l2)), apply(apply(b, combinator), apply(l2, apply(apply(b, apply(b, combinator)), l2))))
% 7.04/1.26 = { by axiom 1 (l2_definition) }
% 7.04/1.26 apply(apply(apply(b, combinator), apply(l2, apply(apply(b, apply(b, combinator)), l2))), apply(apply(apply(b, apply(b, combinator)), l2), apply(apply(b, apply(b, combinator)), l2)))
% 7.04/1.26 = { by axiom 2 (b_definition) }
% 7.04/1.26 apply(combinator, apply(apply(l2, apply(apply(b, apply(b, combinator)), l2)), apply(apply(apply(b, apply(b, combinator)), l2), apply(apply(b, apply(b, combinator)), l2))))
% 7.04/1.26 = { by axiom 1 (l2_definition) R->L }
% 7.04/1.26 apply(combinator, apply(apply(l2, apply(apply(b, apply(b, combinator)), l2)), apply(l2, apply(apply(b, apply(b, combinator)), l2))))
% 7.04/1.26 % SZS output end Proof
% 7.04/1.26
% 7.04/1.26 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------