TSTP Solution File: SYN323+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SYN323+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n027.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:42:27 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.03/0.12 % Problem : SYN323+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Mar 20 23:16:45 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: church_46_4_2 ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.34 cnf(church_46_4_2-1, negated_conjecture, ( ~_def0(_u0, _u2) | big_g(_u0, _u2) )).
% 0.13/0.34 cnf(church_46_4_2-2, negated_conjecture, ( ~_def1(_u1, _u2) | ~big_g(_u1, _u2) )).
% 0.13/0.34 cnf(church_46_4_2-3, negated_conjecture, ( _def0(_u0, _u2) | big_f(_u0, _u2) )).
% 0.13/0.34 cnf(church_46_4_2-4, negated_conjecture, ( _def0(_u0, _u2) | ~big_f(_u2, _u0) )).
% 0.13/0.34 cnf(church_46_4_2-5, negated_conjecture, ( _def1(_u1, _u2) | big_f(_u1, _u2) )).
% 0.13/0.34 cnf(church_46_4_2-6, negated_conjecture, ( _def1(_u1, _u2) | ~big_f(_u2, _u1) )).
% 0.13/0.34
% 0.13/0.34 % Problem matrix:
% 0.13/0.34 cnf(matrix-0, plain, ( ~_def0(_u0, _u2) | big_g(_u0, _u2) )).
% 0.13/0.34 cnf(matrix-1, plain, ( ~_def1(_u1, _u2) | ~big_g(_u1, _u2) )).
% 0.13/0.34 cnf(matrix-2, plain, ( _def0(_u0, _u2) | big_f(_u0, _u2) )).
% 0.13/0.34 cnf(matrix-3, plain, ( _def0(_u0, _u2) | ~big_f(_u2, _u0) )).
% 0.13/0.34 cnf(matrix-4, plain, ( _def1(_u1, _u2) | big_f(_u1, _u2) )).
% 0.13/0.34 cnf(matrix-5, plain, ( _def1(_u1, _u2) | ~big_f(_u2, _u1) )).
% 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(1),
% 0.13/0.34 left_branch(0, 5, 0, 2),
% 0.13/0.34 left_branch(0, 4, 1, 3),
% 0.13/0.34 reduction(0, 0),
% 0.13/0.34 right_branch(3),
% 0.13/0.34 right_branch(2),
% 0.13/0.34 left_branch(0, 0, 1, 3),
% 0.13/0.34 left_branch(0, 3, 0, 4),
% 0.13/0.34 left_branch(0, 2, 1, 5),
% 0.13/0.34 reduction(0, 1),
% 0.13/0.34 right_branch(5),
% 0.13/0.34 right_branch(4),
% 0.13/0.34 right_branch(3)
% 0.13/0.34 )).
% 0.13/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------