TSTP Solution File: PUZ035-6 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : PUZ035-6 : TPTP v8.1.0. Released v2.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 : n017.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:55 EDT 2022
% Result : Unsatisfiable 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ035-6 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n017.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.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun May 29 00:02:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Unsatisfiable
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 ~truth(isa(other,X0)) | ~truth(isa(asked,X1))).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 ~truth(isa(other,X0)) | ~truth(isa(asked,X1)),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 truth(isa(X2,knave)) | truth(isa(X2,knight))).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 isa(other,X0) = isa(X2,knave)).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 ~truth(isa(asked,X1)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 truth(isa(X2,knight)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 ~truth(isa(other,X3)) | ~truth(isa(asked,X4))).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 isa(X2,knight) = isa(other,X3)).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 ~truth(isa(asked,X4)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 truth(isa(X5,knave)) | truth(isa(X5,knight))).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 isa(asked,X4) = isa(X5,knight)).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 truth(isa(X5,knave)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 ~truth(isa(other,X6)) | ~truth(isa(asked,X7))).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 isa(X5,knave) = isa(asked,X7)).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 ~truth(isa(other,X6)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, plain,
% 0.13/0.35 truth(isa(X2,knight))).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 isa(other,X6) = isa(X2,knight)).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a4])], [c13, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c16, axiom,
% 0.13/0.35 truth(isa(X8,knave)) | truth(isa(X8,knight))).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 isa(asked,X1) = isa(X8,knave)).
% 0.13/0.35 cnf(c17, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c3, c16])).
% 0.13/0.35 cnf(c18, plain,
% 0.13/0.35 truth(isa(X8,knight)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c3, c16])).
% 0.13/0.35
% 0.13/0.35 cnf(c19, axiom,
% 0.13/0.35 ~truth(isa(other,X9)) | ~truth(isa(asked,X10))).
% 0.13/0.35 cnf(a6, assumption,
% 0.13/0.35 isa(X8,knight) = isa(asked,X10)).
% 0.13/0.35 cnf(c20, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])).
% 0.13/0.35 cnf(c21, plain,
% 0.13/0.35 ~truth(isa(other,X9)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])).
% 0.13/0.35
% 0.13/0.35 cnf(c22, plain,
% 0.13/0.35 truth(isa(other,X0))).
% 0.13/0.35 cnf(a7, assumption,
% 0.13/0.35 isa(other,X9) = isa(other,X0)).
% 0.13/0.35 cnf(c23, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a7])], [c21, c22])).
% 0.13/0.35
% 0.13/0.35 cnf(c24, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, knave),
% 0.13/0.35 bind(X1, knave),
% 0.13/0.35 bind(X2, other),
% 0.13/0.35 bind(X3, knight),
% 0.13/0.35 bind(X4, knight),
% 0.13/0.35 bind(X5, asked),
% 0.13/0.35 bind(X6, knight),
% 0.13/0.35 bind(X7, knave),
% 0.13/0.35 bind(X8, asked),
% 0.13/0.35 bind(X9, knave),
% 0.13/0.35 bind(X10, knight)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------