TSTP Solution File: MSC012+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n016.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:22:03 EDT 2024
% Result : Theorem 12.19s 12.35s
% Output : Proof 12.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n016.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 17:46:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 12.19/12.35 % SZS status Theorem for theBenchmark
% 12.19/12.35 % SZS output start Proof for theBenchmark
% 12.19/12.35
% 12.19/12.35 % Formula: left_to_right ( axiom ) converted to clauses:
% 12.19/12.35 cnf(left_to_right-1, axiom, ( goal | ~p(_u1) | ~less(_u1, _u0) | ~p(_u0) )).
% 12.19/12.35
% 12.19/12.35 % Formula: right_to_left ( axiom ) converted to clauses:
% 12.19/12.35 cnf(right_to_left-1, axiom, ( p(_u3) | less(_u3, skolem1(_u3)) )).
% 12.19/12.35 cnf(right_to_left-2, axiom, ( p(_u3) | p(skolem1(_u3)) )).
% 12.19/12.35
% 12.19/12.35 % Formula: transitive_less ( axiom ) converted to clauses:
% 12.19/12.35 cnf(transitive_less-1, axiom, ( ~less(_u6, _u5) | ~less(_u5, _u4) | less(_u6, _u4) )).
% 12.19/12.35
% 12.19/12.35 % Formula: serial_less ( axiom ) converted to clauses:
% 12.19/12.35 cnf(serial_less-1, axiom, ( less(_u8, skolem2(_u8)) )).
% 12.19/12.35
% 12.19/12.35 % Formula: goal_to_be_proved ( conjecture ) (definitionally) converted to clauses:
% 12.19/12.35 cnf(goal_to_be_proved-1, negated_conjecture, ( ~goal )).
% 12.19/12.35
% 12.19/12.35 % Problem matrix:
% 12.19/12.35 cnf(matrix-0, plain, ( goal | ~p(_u1) | ~less(_u1, _u0) | ~p(_u0) )).
% 12.19/12.35 cnf(matrix-1, plain, ( p(_u3) | less(_u3, skolem1(_u3)) )).
% 12.19/12.35 cnf(matrix-2, plain, ( p(_u3) | p(skolem1(_u3)) )).
% 12.19/12.35 cnf(matrix-3, plain, ( ~less(_u6, _u5) | ~less(_u5, _u4) | less(_u6, _u4) )).
% 12.19/12.35 cnf(matrix-4, plain, ( less(_u8, skolem2(_u8)) )).
% 12.19/12.35 cnf(matrix-5, plain, ( ~goal )).
% 12.19/12.35
% 12.19/12.35 % Proof stack:
% 12.19/12.35 cnf(proof-stack, plain,
% 12.19/12.35 proof_stack(
% 12.19/12.35 start(5),
% 12.19/12.35 left_branch(0, 0, 0, 2),
% 12.19/12.35 left_branch(0, 2, 1, 3),
% 12.19/12.35 left_branch(0, 0, 1, 4),
% 12.19/12.35 reduction(0, 0),
% 12.19/12.35 left_branch(0, 4, 0, 6),
% 12.19/12.35 right_branch(6),
% 12.19/12.35 left_branch(0, 2, 0, 7),
% 12.19/12.35 left_branch(0, 0, 3, 8),
% 12.19/12.35 lemmata(0, 0),
% 12.19/12.35 left_branch(0, 3, 2, 10),
% 12.19/12.35 left_branch(0, 4, 0, 11),
% 12.19/12.35 right_branch(11),
% 12.19/12.35 left_branch(0, 1, 1, 12),
% 12.19/12.35 reduction(0, 3),
% 12.19/12.35 right_branch(12),
% 12.19/12.35 right_branch(10),
% 12.19/12.35 reduction(0, 2),
% 12.19/12.35 right_branch(8),
% 12.19/12.35 right_branch(7),
% 12.19/12.35 right_branch(4),
% 12.19/12.35 right_branch(3),
% 12.19/12.35 left_branch(0, 1, 1, 4),
% 12.19/12.35 left_branch(0, 0, 1, 5),
% 12.19/12.35 reduction(0, 0),
% 12.19/12.35 left_branch(0, 4, 0, 7),
% 12.19/12.35 right_branch(7),
% 12.19/12.35 left_branch(0, 2, 0, 8),
% 12.19/12.35 left_branch(0, 0, 3, 9),
% 12.19/12.35 lemmata(0, 1),
% 12.19/12.35 left_branch(0, 3, 2, 11),
% 12.19/12.35 left_branch(0, 4, 0, 12),
% 12.19/12.35 right_branch(12),
% 12.19/12.35 left_branch(0, 1, 1, 13),
% 12.19/12.35 reduction(0, 3),
% 12.19/12.35 right_branch(13),
% 12.19/12.35 right_branch(11),
% 12.19/12.35 reduction(0, 2),
% 12.19/12.35 right_branch(9),
% 12.19/12.35 right_branch(8),
% 12.19/12.35 right_branch(5),
% 12.19/12.35 right_branch(4),
% 12.19/12.35 left_branch(0, 2, 1, 5),
% 12.19/12.35 left_branch(0, 0, 1, 6),
% 12.19/12.35 reduction(0, 0),
% 12.19/12.35 left_branch(0, 4, 0, 8),
% 12.19/12.35 right_branch(8),
% 12.19/12.35 left_branch(0, 2, 0, 9),
% 12.19/12.35 left_branch(0, 0, 3, 10),
% 12.19/12.35 lemmata(0, 2),
% 12.19/12.35 left_branch(0, 3, 2, 12),
% 12.19/12.35 left_branch(0, 4, 0, 13),
% 12.19/12.35 right_branch(13),
% 12.19/12.35 left_branch(0, 1, 1, 14),
% 12.19/12.35 reduction(0, 3),
% 12.19/12.35 right_branch(14),
% 12.19/12.35 right_branch(12),
% 12.19/12.35 reduction(0, 2),
% 12.19/12.35 right_branch(10),
% 12.19/12.35 right_branch(9),
% 12.19/12.35 right_branch(6),
% 12.19/12.35 right_branch(5),
% 12.19/12.35 right_branch(2)
% 12.19/12.35 )).
% 12.19/12.35 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------