TSTP Solution File: PUZ012-1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : PUZ012-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n013.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:28:57 EDT 2024
% Result : Unsatisfiable 0.13s 0.37s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ012-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n013.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:22:48 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% 0.13/0.37
% 0.13/0.37 % Problem matrix:
% 0.13/0.37 cnf(matrix-0, plain, ( equal_fruits(X, X) )).
% 0.13/0.37 cnf(matrix-1, plain, ( equal_boxes(X, X) )).
% 0.13/0.37 cnf(matrix-2, plain, ( ~label(X, Y) | ~contains(X, Y) )).
% 0.13/0.37 cnf(matrix-3, plain, ( contains(boxa, X) | contains(boxb, X) | contains(boxc, X) )).
% 0.13/0.37 cnf(matrix-4, plain, ( contains(X, apples) | contains(X, bananas) | contains(X, oranges) )).
% 0.13/0.37 cnf(matrix-5, plain, ( ~contains(X, Y) | ~contains(X, Z) | equal_fruits(Y, Z) )).
% 0.13/0.37 cnf(matrix-6, plain, ( ~contains(X, Y) | ~contains(Z, Y) | equal_boxes(X, Z) )).
% 0.13/0.37 cnf(matrix-7, plain, ( ~equal_boxes(boxa, boxb) )).
% 0.13/0.37 cnf(matrix-8, plain, ( ~equal_boxes(boxb, boxc) )).
% 0.13/0.37 cnf(matrix-9, plain, ( ~equal_boxes(boxa, boxc) )).
% 0.13/0.37 cnf(matrix-10, plain, ( ~equal_fruits(apples, bananas) )).
% 0.13/0.37 cnf(matrix-11, plain, ( ~equal_fruits(bananas, oranges) )).
% 0.13/0.37 cnf(matrix-12, plain, ( ~equal_fruits(apples, oranges) )).
% 0.13/0.37 cnf(matrix-13, plain, ( label(boxa, apples) )).
% 0.13/0.37 cnf(matrix-14, plain, ( label(boxb, oranges) )).
% 0.13/0.37 cnf(matrix-15, plain, ( label(boxc, bananas) )).
% 0.13/0.37 cnf(matrix-16, plain, ( contains(boxb, apples) )).
% 0.13/0.37 cnf(matrix-17, plain, ( ~contains(boxa, bananas) | ~contains(boxc, oranges) )).
% 0.13/0.37
% 0.13/0.37 % Proof stack:
% 0.13/0.37 cnf(proof-stack, plain,
% 0.13/0.37 proof_stack(
% 0.13/0.37 start(8),
% 0.13/0.37 left_branch(0, 6, 2, 2),
% 0.13/0.37 left_branch(0, 16, 0, 3),
% 0.13/0.37 right_branch(3),
% 0.13/0.37 left_branch(0, 4, 0, 4),
% 0.13/0.37 left_branch(0, 17, 1, 5),
% 0.13/0.37 left_branch(0, 4, 1, 6),
% 0.13/0.37 left_branch(0, 2, 1, 7),
% 0.13/0.37 left_branch(0, 13, 0, 8),
% 0.13/0.37 right_branch(8),
% 0.13/0.37 right_branch(7),
% 0.13/0.37 left_branch(0, 6, 0, 8),
% 0.13/0.37 left_branch(0, 9, 0, 9),
% 0.13/0.37 right_branch(9),
% 0.13/0.37 reduction(0, 2),
% 0.13/0.37 right_branch(8),
% 0.13/0.37 right_branch(6),
% 0.13/0.37 right_branch(5),
% 0.13/0.37 left_branch(0, 2, 1, 6),
% 0.13/0.37 left_branch(0, 15, 0, 7),
% 0.13/0.37 right_branch(7),
% 0.13/0.37 right_branch(6),
% 0.13/0.37 right_branch(4),
% 0.13/0.37 right_branch(2)
% 0.13/0.37 )).
% 0.13/0.37 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------