TSTP Solution File: SWW469+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SWW469+1 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n032.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 Mar 25 14:40:37 EDT 2024
% Result : Theorem 0.09s 0.29s
% Output : Proof 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWW469+1 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.09 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Thu Mar 21 01:35:55 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.09/0.29 % SZS status Theorem for theBenchmark
% 0.09/0.29 % SZS output start Proof for theBenchmark
% 0.09/0.29
% 0.09/0.29 % Formula: gsy_c_HOL_Oundefined_000tc__Com__Ostate ( axiom ) converted to clauses:
% 0.09/0.29 cnf(gsy_c_HOL_Oundefined_000tc__Com__Ostate-1, axiom, ( is_state(undefined_state(state)) )).
% 0.09/0.29
% 0.09/0.29 % Formula: fact_0_state__not__singleton__def ( axiom ) converted to clauses:
% 0.09/0.29 cnf(fact_0_state__not__singleton__def-1, axiom, ( ~hoare_165779456gleton | is_state(skolem1) )).
% 0.09/0.29 cnf(fact_0_state__not__singleton__def-2, axiom, ( ~hoare_165779456gleton | is_state(skolem2) )).
% 0.09/0.29 cnf(fact_0_state__not__singleton__def-3, axiom, ( ~hoare_165779456gleton | ( skolem1 != skolem2) )).
% 0.09/0.29 cnf(fact_0_state__not__singleton__def-4, axiom, ( ~is_state(_u3) | ~is_state(_u2) | ( _u3 = _u2) | hoare_165779456gleton )).
% 0.09/0.29
% 0.09/0.29 % Formula: fact_1_induct__false__def ( axiom ) converted to clauses:
% 0.09/0.29 cnf(fact_1_induct__false__def-1, axiom, ( ~induct_false )).
% 0.09/0.29
% 0.09/0.29 % Formula: fact_2_induct__trueI ( axiom ) converted to clauses:
% 0.09/0.29 cnf(fact_2_induct__trueI-1, axiom, ( induct_true )).
% 0.09/0.29
% 0.09/0.29 % Formula: fact_3_induct__true__def ( axiom ) converted to clauses:
% 0.09/0.29 cnf(fact_3_induct__true__def-1, axiom, ( induct_true )).
% 0.09/0.29
% 0.09/0.29 % Formula: conj_0 ( hypothesis ) converted to clauses:
% 0.09/0.29 cnf(conj_0-1, hypothesis, ( hoare_165779456gleton )).
% 0.09/0.29
% 0.09/0.29 % Formula: conj_1 ( conjecture ) (definitionally) converted to clauses:
% 0.09/0.29 cnf(conj_1-1, negated_conjecture, ( is_state(skolem3) )).
% 0.09/0.29 cnf(conj_1-2, negated_conjecture, ( ~is_state(_u4) | ( _u4 = skolem3) )).
% 0.09/0.29
% 0.09/0.29 % Problem matrix:
% 0.09/0.29 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.09/0.29 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.09/0.29 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.09/0.29 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( undefined_state(__eqx_0) = undefined_state(__eqy_0)) )).
% 0.09/0.29 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ~is_state(__eqx_0) | is_state(__eqy_0) )).
% 0.09/0.29 cnf(matrix-5, plain, ( is_state(undefined_state(state)) )).
% 0.09/0.29 cnf(matrix-6, plain, ( ~hoare_165779456gleton | is_state(skolem1) )).
% 0.09/0.29 cnf(matrix-7, plain, ( ~hoare_165779456gleton | is_state(skolem2) )).
% 0.09/0.29 cnf(matrix-8, plain, ( ~hoare_165779456gleton | ( skolem1 != skolem2) )).
% 0.09/0.29 cnf(matrix-9, plain, ( ~is_state(_u3) | ~is_state(_u2) | ( _u3 = _u2) | hoare_165779456gleton )).
% 0.09/0.29 cnf(matrix-10, plain, ( ~induct_false )).
% 0.09/0.29 cnf(matrix-11, plain, ( induct_true )).
% 0.09/0.29 cnf(matrix-12, plain, ( induct_true )).
% 0.09/0.29 cnf(matrix-13, plain, ( hoare_165779456gleton )).
% 0.09/0.29 cnf(matrix-14, plain, ( is_state(skolem3) )).
% 0.09/0.29 cnf(matrix-15, plain, ( ~is_state(_u4) | ( _u4 = skolem3) )).
% 0.09/0.29
% 0.09/0.29 % Proof stack:
% 0.09/0.29 cnf(proof-stack, plain,
% 0.09/0.29 proof_stack(
% 0.09/0.29 start(8),
% 0.09/0.29 left_branch(0, 13, 0, 2),
% 0.09/0.29 right_branch(2),
% 0.09/0.29 left_branch(0, 2, 2, 3),
% 0.09/0.29 left_branch(0, 15, 1, 4),
% 0.09/0.29 left_branch(0, 6, 1, 5),
% 0.09/0.29 lemmata(0, 0),
% 0.09/0.29 right_branch(5),
% 0.09/0.29 right_branch(4),
% 0.09/0.29 left_branch(0, 1, 1, 5),
% 0.09/0.29 left_branch(0, 15, 1, 6),
% 0.09/0.29 left_branch(0, 7, 1, 7),
% 0.09/0.29 lemmata(0, 0),
% 0.09/0.29 right_branch(7),
% 0.09/0.29 right_branch(6),
% 0.09/0.29 right_branch(5),
% 0.09/0.29 right_branch(3)
% 0.09/0.29 )).
% 0.09/0.29 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------