TSTP Solution File: PUZ025-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : PUZ025-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n003.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 : Thu Aug 31 13:10:56 EDT 2023
% Result : Unsatisfiable 0.20s 0.71s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ025-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 22:24:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 0.20/0.70 %-------------------------------------------
% 0.20/0.70 % File :CSE---1.6
% 0.20/0.70 % Problem :theBenchmark
% 0.20/0.70 % Transform :cnf
% 0.20/0.70 % Format :tptp:raw
% 0.20/0.70 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.70
% 0.20/0.70 % Result :Theorem 0.060000s
% 0.20/0.70 % Output :CNFRefutation 0.060000s
% 0.20/0.70 %-------------------------------------------
% 0.20/0.70 %--------------------------------------------------------------------------
% 0.20/0.70 % File : PUZ025-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.70 % Domain : Puzzles
% 0.20/0.70 % Problem : Knights and Knaves #35
% 0.20/0.70 % Version : Especial.
% 0.20/0.70 % English : There is an island with exactly two types of people -
% 0.20/0.70 % truthtellers who always tell the truth and liars who always lie.
% 0.20/0.70 % There are a group of three people, A, B, and C on the island.
% 0.20/0.70 % A and B make the following statements. A: "B and C are the same
% 0.20/0.70 % type". Someone asks "Are A and B of the same type ? " What does
% 0.20/0.70 % C answer? Answer: "yes"
% 0.20/0.70
% 0.20/0.70 % Refs : [Smu78] Smullyan (1978), What is the Name of this Book?
% 0.20/0.70 % Source : [ANL]
% 0.20/0.70 % Names : Problem 35 [Smu78]
% 0.20/0.70 % : tandl35.ver1.in [ANL]
% 0.20/0.70
% 0.20/0.70 % Status : Unsatisfiable
% 0.20/0.70 % Rating : 0.14 v8.1.0, 0.00 v2.0.0
% 0.20/0.70 % Syntax : Number of clauses : 24 ( 7 unt; 6 nHn; 21 RR)
% 0.20/0.70 % Number of literals : 61 ( 0 equ; 34 neg)
% 0.20/0.70 % Maximal clause size : 4 ( 2 avg)
% 0.20/0.70 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.70 % Number of predicates : 4 ( 4 usr; 0 prp; 1-3 aty)
% 0.20/0.70 % Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% 0.20/0.70 % Number of variables : 35 ( 3 sgn)
% 0.20/0.70 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.70
% 0.20/0.70 % Comments :
% 0.20/0.70 %--------------------------------------------------------------------------
% 0.20/0.70 %----Include axioms for truthtellers and liars
% 0.20/0.70 include('Axioms/PUZ002-0.ax').
% 0.20/0.70 %--------------------------------------------------------------------------
% 0.20/0.70 %----The next 6 clause define what is meant by being of equal type
% 0.20/0.70 cnf(two_liars_are_equal,axiom,
% 0.20/0.70 ( ~ people(X,Y,Z)
% 0.20/0.70 | ~ a_truth(liar(X))
% 0.20/0.70 | ~ a_truth(liar(Y))
% 0.20/0.70 | a_truth(equal_type(X,Y)) ) ).
% 0.20/0.70
% 0.20/0.70 cnf(two_truthtellers_are_equal,axiom,
% 0.20/0.70 ( ~ people(X,Y,Z)
% 0.20/0.70 | ~ a_truth(truthteller(X))
% 0.20/0.70 | ~ a_truth(truthteller(Y))
% 0.20/0.70 | a_truth(equal_type(X,Y)) ) ).
% 0.20/0.70
% 0.20/0.70 cnf(truthteller_equals_truthtller,axiom,
% 0.20/0.70 ( ~ a_truth(equal_type(X,Y))
% 0.20/0.70 | ~ a_truth(truthteller(X))
% 0.20/0.70 | a_truth(truthteller(Y)) ) ).
% 0.20/0.70
% 0.20/0.70 cnf(liar_equals_liar,axiom,
% 0.20/0.70 ( ~ a_truth(equal_type(X,Y))
% 0.20/0.70 | ~ a_truth(liar(X))
% 0.20/0.70 | a_truth(liar(Y)) ) ).
% 0.20/0.70
% 0.20/0.70 cnf(truthteller_not_equal_liar,axiom,
% 0.20/0.70 ( ~ a_truth(truthteller(X))
% 0.20/0.70 | a_truth(equal_type(X,Y))
% 0.20/0.70 | a_truth(liar(Y)) ) ).
% 0.20/0.70
% 0.20/0.70 cnf(liar_not_equal_truthteller,axiom,
% 0.20/0.70 ( ~ a_truth(liar(X))
% 0.20/0.71 | a_truth(equal_type(X,Y))
% 0.20/0.71 | a_truth(truthteller(Y)) ) ).
% 0.20/0.71
% 0.20/0.71 cnf(symmetry_of_equal_type,axiom,
% 0.20/0.71 ( ~ a_truth(equal_type(X,Y))
% 0.20/0.71 | a_truth(equal_type(Y,X)) ) ).
% 0.20/0.71
% 0.20/0.71 cnf(truthteller_identifies_truths,axiom,
% 0.20/0.71 ( ~ ask_1_if_2(X,Y)
% 0.20/0.71 | ~ a_truth(truthteller(X))
% 0.20/0.71 | ~ a_truth(Y)
% 0.20/0.71 | answer(yes) ) ).
% 0.20/0.71
% 0.20/0.71 cnf(truthteller_denies_lies,axiom,
% 0.20/0.71 ( ~ ask_1_if_2(X,Y)
% 0.20/0.71 | ~ a_truth(truthteller(X))
% 0.20/0.71 | a_truth(Y)
% 0.20/0.71 | answer(no) ) ).
% 0.20/0.71
% 0.20/0.71 cnf(liar_denies_truths,axiom,
% 0.20/0.71 ( ~ ask_1_if_2(X,Y)
% 0.20/0.71 | ~ a_truth(liar(X))
% 0.20/0.71 | ~ a_truth(Y)
% 0.20/0.71 | answer(no) ) ).
% 0.20/0.71
% 0.20/0.71 cnf(liar_supports_lies,axiom,
% 0.20/0.71 ( ~ ask_1_if_2(X,Y)
% 0.20/0.71 | ~ a_truth(liar(X))
% 0.20/0.71 | a_truth(Y)
% 0.20/0.71 | answer(yes) ) ).
% 0.20/0.71
% 0.20/0.71 cnf(b_c_a_are_people,hypothesis,
% 0.20/0.71 people(b,c,a) ).
% 0.20/0.71
% 0.20/0.71 %----bugs here
% 0.20/0.71 cnf(a_b_c_are_people,hypothesis,
% 0.20/0.71 people(a,b,a) ).
% 0.20/0.71
% 0.20/0.71 cnf(a_c_b_are_people,hypothesis,
% 0.20/0.71 people(a,c,b) ).
% 0.20/0.71
% 0.20/0.71 cnf(c_b_a_are_people,hypothesis,
% 0.20/0.71 people(c,b,a) ).
% 0.20/0.71
% 0.20/0.71 cnf(a_says_b_and_c_equal,hypothesis,
% 0.20/0.71 a_truth(says(a,equal_type(b,c))) ).
% 0.20/0.71
% 0.20/0.71 cnf(ask_c_if_a_and_b_equal,hypothesis,
% 0.20/0.71 ask_1_if_2(c,equal_type(a,b)) ).
% 0.20/0.71
% 0.20/0.71 cnf(prove_there_is_an_answer,negated_conjecture,
% 0.20/0.71 ~ answer(Answer) ).
% 0.20/0.71
% 0.20/0.71 %--------------------------------------------------------------------------
% 0.20/0.71 %-------------------------------------------
% 0.20/0.71 % Proof found
% 0.20/0.71 % SZS status Theorem for theBenchmark
% 0.20/0.71 % SZS output start Proof
% 0.20/0.71 %ClaNum:24(EqnAxiom:0)
% 0.20/0.71 %VarNum:71(SingletonVarNum:35)
% 0.20/0.71 %MaxLitNum:4
% 0.20/0.71 %MaxfuncDepth:2
% 0.20/0.71 %SharedTerms:16
% 0.20/0.71 %goalClause: 7
% 0.20/0.71 %singleGoalClaCount:1
% 0.20/0.71 [2]P4(a3,a1,a2)
% 0.20/0.71 [3]P4(a1,a3,a2)
% 0.20/0.71 [4]P4(a2,a3,a2)
% 0.20/0.71 [5]P4(a2,a1,a3)
% 0.20/0.71 [1]P1(a1,f4(a2,a3))
% 0.20/0.71 [6]P2(f5(a2,f4(a3,a1)))
% 0.20/0.71 [7]~P3(x71)
% 0.20/0.71 [8]P2(f6(x81))+P2(f8(x81))
% 0.20/0.71 [9]~P2(f6(x91))+~P2(f8(x91))
% 0.20/0.71 [22]~P2(f4(x222,x221))+P2(f4(x221,x222))
% 0.20/0.71 [14]~P2(f6(x142))+P2(f8(x141))+P2(f4(x142,x141))
% 0.20/0.71 [15]~P2(f8(x152))+P2(f6(x151))+P2(f4(x152,x151))
% 0.20/0.71 [16]P2(x161)+~P2(f5(x162,x161))+P2(f6(x162))
% 0.20/0.71 [17]~P2(x172)+~P2(f5(x171,x172))+P2(f8(x171))
% 0.20/0.71 [18]P2(x181)+~P2(f5(x182,x181))+~P2(f8(x182))
% 0.20/0.71 [19]~P2(x191)+~P2(f5(x192,x191))+~P2(f6(x192))
% 0.20/0.71 [20]~P2(f4(x202,x201))+P2(f8(x201))+~P2(f8(x202))
% 0.20/0.71 [21]~P2(f4(x212,x211))+P2(f6(x211))+~P2(f6(x212))
% 0.20/0.71 [10]P2(x101)+~P1(x102,x101)+P3(a9)+~P2(f6(x102))
% 0.20/0.71 [11]P2(x111)+~P1(x112,x111)+P3(a7)+~P2(f8(x112))
% 0.20/0.71 [12]~P2(x121)+~P1(x122,x121)+P3(a9)+~P2(f8(x122))
% 0.20/0.71 [13]~P2(x131)+~P1(x132,x131)+P3(a7)+~P2(f6(x132))
% 0.20/0.71 [23]~P4(x231,x232,x233)+~P2(f8(x232))+~P2(f8(x231))+P2(f4(x231,x232))
% 0.20/0.71 [24]~P4(x241,x242,x243)+~P2(f6(x242))+~P2(f6(x241))+P2(f4(x241,x242))
% 0.20/0.71 %EqnAxiom
% 0.20/0.71
% 0.20/0.71 %-------------------------------------------
% 0.20/0.71 cnf(47,plain,
% 0.20/0.71 (P2(x471)+~P1(x472,x471)+~P2(f6(x472))),
% 0.20/0.71 inference(scs_inference,[],[7,10])).
% 0.20/0.71 cnf(48,plain,
% 0.20/0.71 (P2(x481)+~P1(x482,x481)+~P2(f8(x482))),
% 0.20/0.71 inference(scs_inference,[],[7,11])).
% 0.20/0.71 cnf(49,plain,
% 0.20/0.71 (~P2(x491)+~P1(x492,x491)+~P2(f8(x492))),
% 0.20/0.71 inference(scs_inference,[],[7,12])).
% 0.20/0.71 cnf(50,plain,
% 0.20/0.71 (~P2(x501)+~P1(x502,x501)+~P2(f6(x502))),
% 0.20/0.71 inference(scs_inference,[],[7,13])).
% 0.20/0.71 cnf(52,plain,
% 0.20/0.71 (~P2(f8(a1))+~P2(f4(a2,a3))),
% 0.20/0.71 inference(scs_inference,[],[1,6,50,49])).
% 0.20/0.71 cnf(53,plain,
% 0.20/0.71 (~P2(f8(a1))+P2(f4(a2,a3))),
% 0.20/0.71 inference(scs_inference,[],[1,6,50,49,48])).
% 0.20/0.71 cnf(55,plain,
% 0.20/0.71 (~P2(f6(a1))+P2(f4(a2,a3))),
% 0.20/0.71 inference(scs_inference,[],[1,6,50,49,48,47])).
% 0.20/0.71 cnf(104,plain,
% 0.20/0.71 (~P2(f6(a1))+~P2(f4(a2,a3))),
% 0.20/0.71 inference(scs_inference,[],[1,50])).
% 0.20/0.71 cnf(141,plain,
% 0.20/0.71 (~P2(f8(a1))+P2(f4(a3,a2))),
% 0.20/0.71 inference(scs_inference,[],[53,22])).
% 0.20/0.71 cnf(142,plain,
% 0.20/0.71 (~P2(f6(a1))),
% 0.20/0.71 inference(scs_inference,[],[55,104])).
% 0.20/0.71 cnf(154,plain,
% 0.20/0.71 ($false),
% 0.20/0.71 inference(scs_inference,[],[142,6,8,48,18,49,141,53,52]),
% 0.20/0.71 ['proof']).
% 0.20/0.71 % SZS output end Proof
% 0.20/0.71 % Total time :0.060000s
%------------------------------------------------------------------------------