TSTP Solution File: PUZ009-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n028.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 : 600s
% DateTime : Mon Jul 18 18:18:52 EDT 2022
% Result : Unsatisfiable 0.19s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n028.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 : 600
% 0.13/0.33 % DateTime : Sun May 29 03:01:33 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.34 % SZS status Unsatisfiable
% 0.19/0.34 % SZS output begin IncompleteProof
% 0.19/0.34 cnf(c0, axiom,
% 0.19/0.34 b_is_a_knight).
% 0.19/0.34 cnf(c1, plain,
% 0.19/0.34 b_is_a_knight,
% 0.19/0.34 inference(start, [], [c0])).
% 0.19/0.34
% 0.19/0.34 cnf(c2, axiom,
% 0.19/0.34 c_is_a_knight | ~b_is_a_knight | d_is_a_knight).
% 0.19/0.34 cnf(c3, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [], [c1, c2])).
% 0.19/0.34 cnf(c4, plain,
% 0.19/0.34 c_is_a_knight | d_is_a_knight,
% 0.19/0.34 inference(strict_predicate_extension, [], [c1, c2])).
% 0.19/0.34
% 0.19/0.34 cnf(c5, axiom,
% 0.19/0.34 ~c_is_a_knight | a_is_a_knight).
% 0.19/0.34 cnf(c6, plain,
% 0.19/0.34 d_is_a_knight,
% 0.19/0.34 inference(strict_predicate_extension, [], [c4, c5])).
% 0.19/0.34 cnf(c7, plain,
% 0.19/0.34 a_is_a_knight,
% 0.19/0.34 inference(strict_predicate_extension, [], [c4, c5])).
% 0.19/0.34
% 0.19/0.34 cnf(c8, axiom,
% 0.19/0.34 ~a_is_a_knight | ~b_is_a_knight).
% 0.19/0.34 cnf(c9, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [], [c7, c8])).
% 0.19/0.34 cnf(c10, plain,
% 0.19/0.34 ~b_is_a_knight,
% 0.19/0.34 inference(strict_predicate_extension, [], [c7, c8])).
% 0.19/0.34
% 0.19/0.34 cnf(c11, plain,
% 0.19/0.34 b_is_a_knight).
% 0.19/0.34 cnf(c12, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(predicate_reduction, [], [c10, c11])).
% 0.19/0.34
% 0.19/0.34 cnf(c13, axiom,
% 0.19/0.34 c_is_a_knight | ~d_is_a_knight | ~e_is_a_knight).
% 0.19/0.34 cnf(c14, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [], [c6, c13])).
% 0.19/0.34 cnf(c15, plain,
% 0.19/0.34 c_is_a_knight | ~e_is_a_knight,
% 0.19/0.34 inference(strict_predicate_extension, [], [c6, c13])).
% 0.19/0.34
% 0.19/0.34 cnf(c16, plain,
% 0.19/0.34 ~c_is_a_knight).
% 0.19/0.34 cnf(c17, plain,
% 0.19/0.34 ~e_is_a_knight,
% 0.19/0.34 inference(predicate_reduction, [], [c15, c16])).
% 0.19/0.34
% 0.19/0.34 cnf(c18, axiom,
% 0.19/0.34 e_is_a_knight | a_is_a_knight).
% 0.19/0.34 cnf(c19, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [], [c17, c18])).
% 0.19/0.34 cnf(c20, plain,
% 0.19/0.34 a_is_a_knight,
% 0.19/0.34 inference(strict_predicate_extension, [], [c17, c18])).
% 0.19/0.34
% 0.19/0.34 cnf(c21, plain,
% 0.19/0.34 ~a_is_a_knight).
% 0.19/0.34 cnf(c22, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(predicate_reduction, [], [c20, c21])).
% 0.19/0.34
% 0.19/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------