TSTP Solution File: SYN000+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SYN000+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 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 Mar 25 14:41:29 EDT 2024
% Result : Theorem 0.13s 0.34s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN000+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Mar 20 23:16:34 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start Proof for theBenchmark
% 0.13/0.34
% 0.13/0.34 % Formula: propositional ( axiom ) converted to clauses:
% 0.13/0.34 cnf(propositional-1, axiom, ( ~p0 | q0 | r0 | ~s0 )).
% 0.13/0.34
% 0.13/0.34 % Formula: first_order ( axiom ) converted to clauses:
% 0.13/0.34 cnf(first_order-1, axiom, ( ~p(_u2) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(first_order-2, axiom, ( ~p(_u2) | r(_u2, f(skolem1(_u2)), g(_u2, f(skolem1(_u2)), skolem2(_u2))) )).
% 0.13/0.34 cnf(first_order-3, axiom, ( q(_u2, a) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(first_order-4, axiom, ( q(_u2, a) | r(_u2, f(skolem1(_u2)), g(_u2, f(skolem1(_u2)), skolem2(_u2))) )).
% 0.13/0.34
% 0.13/0.34 % Formula: equality ( axiom ) converted to clauses:
% 0.13/0.34 cnf(equality-1, axiom, ( ( f(f(f(b))) != a) | ( _u4 = f(skolem3)) | ( f(skolem3) = g(_u4, f(skolem3), _u3)) )).
% 0.13/0.34
% 0.13/0.34 % Formula: true_false ( axiom ) converted to clauses:
% 0.13/0.34 cnf(true_false, axiom, $true).
% 0.13/0.34
% 0.13/0.34 % Formula: single_quoted ( axiom ) converted to clauses:
% 0.13/0.34 cnf(single_quoted-1, axiom, ( A proposition | A predicate(a) | p(A constant) | p(A function(a)) | p(A 'quoted \ escape') )).
% 0.13/0.34
% 0.13/0.34 % Formula: useful_connectives ( axiom ) converted to clauses:
% 0.13/0.34 cnf(useful_connectives-1, axiom, ( ~q(_u19, a) | s(f(f(f(b)))) | ~r(_u19, f(skolem6(_u19)), g(_u19, f(skolem6(_u19)), skolem7(_u19))) )).
% 0.13/0.34 cnf(useful_connectives-2, axiom, ( ~q(_u19, a) | r(_u19, f(skolem4(_u19)), g(_u19, f(skolem4(_u19)), skolem5(_u19))) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(useful_connectives-3, axiom, ( ~q(_u19, a) | r(_u19, f(skolem4(_u19)), g(_u19, f(skolem4(_u19)), skolem5(_u19))) | ~r(_u19, f(skolem6(_u19)), g(_u19, f(skolem6(_u19)), skolem7(_u19))) )).
% 0.13/0.34 cnf(useful_connectives-4, axiom, ( ~p(_u19) | s(f(f(f(b)))) | ~r(_u19, f(skolem6(_u19)), g(_u19, f(skolem6(_u19)), skolem7(_u19))) )).
% 0.13/0.34 cnf(useful_connectives-5, axiom, ( ~p(_u19) | r(_u19, f(skolem4(_u19)), g(_u19, f(skolem4(_u19)), skolem5(_u19))) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(useful_connectives-6, axiom, ( ~p(_u19) | r(_u19, f(skolem4(_u19)), g(_u19, f(skolem4(_u19)), skolem5(_u19))) | ~r(_u19, f(skolem6(_u19)), g(_u19, f(skolem6(_u19)), skolem7(_u19))) )).
% 0.13/0.34 cnf(useful_connectives-7, axiom, ( q(_u20, a) | p(_u20) | ~s(f(f(f(b)))) | ~r(_u20, f(_u17), g(_u20, f(_u17), _u15)) )).
% 0.13/0.34 cnf(useful_connectives-8, axiom, ( q(_u20, a) | p(_u20) | s(f(f(f(b)))) | r(_u20, f(_u18), g(_u20, f(_u18), _u16)) )).
% 0.13/0.34
% 0.13/0.34 % Formula: 123 ( axiom ) converted to clauses:
% 0.13/0.34 cnf(123-1, axiom, ( ~p(_u23) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(123-2, axiom, ( ~p(_u23) | r(_u23, f(skolem8(_u23)), g(_u23, f(skolem8(_u23)), skolem9(_u23))) )).
% 0.13/0.34 cnf(123-3, axiom, ( q(_u23, a) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(123-4, axiom, ( q(_u23, a) | r(_u23, f(skolem8(_u23)), g(_u23, f(skolem8(_u23)), skolem9(_u23))) )).
% 0.13/0.34
% 0.13/0.34 % Formula: role_hypothesis ( hypothesis ) converted to clauses:
% 0.13/0.34 cnf(role_hypothesis-1, hypothesis, ( p(h) )).
% 0.13/0.34
% 0.13/0.34 % Formula: role_conjecture ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.34 cnf(role_conjecture-1, negated_conjecture, ( ~p(_u24) )).
% 0.13/0.34
% 0.13/0.34 % Formula: ia1 ( axiom ) converted to clauses:
% 0.13/0.34 cnf(ia1-1, axiom, ( ia1 )).
% 0.13/0.34
% 0.13/0.34 % Formula: ia2 ( axiom ) converted to clauses:
% 0.13/0.34 cnf(ia2-1, axiom, ( ia2 )).
% 0.13/0.34
% 0.13/0.34 % Formula: ia3 ( axiom ) converted to clauses:
% 0.13/0.34 cnf(ia3-1, axiom, ( ia3 )).
% 0.13/0.34
% 0.13/0.34 % Problem matrix:
% 0.13/0.34 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.34 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( f(__eqx_0) = f(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( g(__eqx_0, __eqx_1, __eqx_2) = g(__eqy_0, __eqy_1, __eqy_2)) )).
% 0.13/0.34 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( A function(__eqx_0) = A function(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( skolem2(__eqx_0) = skolem2(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( skolem4(__eqx_0) = skolem4(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( skolem5(__eqx_0) = skolem5(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( skolem6(__eqx_0) = skolem6(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( skolem7(__eqx_0) = skolem7(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( skolem8(__eqx_0) = skolem8(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-13, plain, ( ( __eqx_0 != __eqy_0) | ( skolem9(__eqx_0) = skolem9(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-14, plain, ( ( __eqx_0 != __eqy_0) | ~p(__eqx_0) | p(__eqy_0) )).
% 0.13/0.34 cnf(matrix-15, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~q(__eqx_0, __eqx_1) | q(__eqy_0, __eqy_1) )).
% 0.13/0.34 cnf(matrix-16, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ~r(__eqx_0, __eqx_1, __eqx_2) | r(__eqy_0, __eqy_1, __eqy_2) )).
% 0.13/0.34 cnf(matrix-17, plain, ( ( __eqx_0 != __eqy_0) | ~s(__eqx_0) | s(__eqy_0) )).
% 0.13/0.34 cnf(matrix-18, plain, ( ( __eqx_0 != __eqy_0) | ~A predicate(__eqx_0) | A predicate(__eqy_0) )).
% 0.13/0.34 cnf(matrix-19, plain, ( ~p0 | q0 | r0 | ~s0 )).
% 0.13/0.34 cnf(matrix-20, plain, ( ~p(_u2) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(matrix-21, plain, ( ~p(_u2) | r(_u2, f(skolem1(_u2)), g(_u2, f(skolem1(_u2)), skolem2(_u2))) )).
% 0.13/0.34 cnf(matrix-22, plain, ( q(_u2, a) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(matrix-23, plain, ( q(_u2, a) | r(_u2, f(skolem1(_u2)), g(_u2, f(skolem1(_u2)), skolem2(_u2))) )).
% 0.13/0.34 cnf(matrix-24, plain, ( ( f(f(f(b))) != a) | ( _u4 = f(skolem3)) | ( f(skolem3) = g(_u4, f(skolem3), _u3)) )).
% 0.13/0.34 cnf(matrix-25, plain, ( A proposition | A predicate(a) | p(A constant) | p(A function(a)) | p(A 'quoted \ escape') )).
% 0.13/0.34 cnf(matrix-26, plain, ( ~q(_u19, a) | s(f(f(f(b)))) | ~r(_u19, f(skolem6(_u19)), g(_u19, f(skolem6(_u19)), skolem7(_u19))) )).
% 0.13/0.34 cnf(matrix-27, plain, ( ~q(_u19, a) | r(_u19, f(skolem4(_u19)), g(_u19, f(skolem4(_u19)), skolem5(_u19))) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(matrix-28, plain, ( ~q(_u19, a) | r(_u19, f(skolem4(_u19)), g(_u19, f(skolem4(_u19)), skolem5(_u19))) | ~r(_u19, f(skolem6(_u19)), g(_u19, f(skolem6(_u19)), skolem7(_u19))) )).
% 0.13/0.34 cnf(matrix-29, plain, ( ~p(_u19) | s(f(f(f(b)))) | ~r(_u19, f(skolem6(_u19)), g(_u19, f(skolem6(_u19)), skolem7(_u19))) )).
% 0.13/0.34 cnf(matrix-30, plain, ( ~p(_u19) | r(_u19, f(skolem4(_u19)), g(_u19, f(skolem4(_u19)), skolem5(_u19))) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(matrix-31, plain, ( ~p(_u19) | r(_u19, f(skolem4(_u19)), g(_u19, f(skolem4(_u19)), skolem5(_u19))) | ~r(_u19, f(skolem6(_u19)), g(_u19, f(skolem6(_u19)), skolem7(_u19))) )).
% 0.13/0.34 cnf(matrix-32, plain, ( q(_u20, a) | p(_u20) | ~s(f(f(f(b)))) | ~r(_u20, f(_u17), g(_u20, f(_u17), _u15)) )).
% 0.13/0.34 cnf(matrix-33, plain, ( q(_u20, a) | p(_u20) | s(f(f(f(b)))) | r(_u20, f(_u18), g(_u20, f(_u18), _u16)) )).
% 0.13/0.34 cnf(matrix-34, plain, ( ~p(_u23) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(matrix-35, plain, ( ~p(_u23) | r(_u23, f(skolem8(_u23)), g(_u23, f(skolem8(_u23)), skolem9(_u23))) )).
% 0.13/0.34 cnf(matrix-36, plain, ( q(_u23, a) | ~s(f(f(f(b)))) )).
% 0.13/0.34 cnf(matrix-37, plain, ( q(_u23, a) | r(_u23, f(skolem8(_u23)), g(_u23, f(skolem8(_u23)), skolem9(_u23))) )).
% 0.13/0.34 cnf(matrix-38, plain, ( p(h) )).
% 0.13/0.34 cnf(matrix-39, plain, ( ~p(_u24) )).
% 0.13/0.34 cnf(matrix-40, plain, ( ia1 )).
% 0.13/0.34 cnf(matrix-41, plain, ( ia2 )).
% 0.13/0.34 cnf(matrix-42, plain, ( ia3 )).
% 0.13/0.34
% 0.13/0.34 % Proof stack:
% 0.13/0.34 cnf(proof-stack, plain,
% 0.13/0.34 proof_stack(
% 0.13/0.34 start(39),
% 0.13/0.34 left_branch(0, 38, 0, 2),
% 0.13/0.34 right_branch(2)
% 0.13/0.34 )).
% 0.13/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------