%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : PUZ035-5 : TPTP v8.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n019.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 Jun 24 13:42:11 EDT 2024 % Result : Unsatisfiable 58.50s 58.65s % Output : CNFRefutation 58.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : PUZ035-5 : TPTP v8.2.0. Released v2.0.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n019.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Tue Jun 18 09:50:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.55 start to proof:theBenchmark % 58.50/58.64 %------------------------------------------- % 58.50/58.64 % File :CSE---1.7 % 58.50/58.64 % Problem :theBenchmark % 58.50/58.64 % Transform :cnf % 58.50/58.64 % Format :tptp:raw % 58.50/58.64 % Command :java -jar mcs_scs.jar %d %s % 58.50/58.64 % 58.50/58.64 % Result :Theorem 58.000000s % 58.50/58.64 % Output :CNFRefutation 58.000000s % 58.50/58.64 %------------------------------------------- % 58.50/58.64 %-------------------------------------------------------------------------- % 58.50/58.64 % File : PUZ035-5 : TPTP v8.2.0. Released v2.0.0. % 58.50/58.64 % Domain : Puzzles % 58.50/58.64 % Problem : Knights and Knaves #36 % 58.50/58.64 % Version : [Sto95] axioms. % 58.50/58.64 % Theorem formulation : Definite answer "yes". % 58.50/58.64 % English : On an island, there live exactly two types of people: knights % 58.50/58.64 % and knaves. Knights always tell the truth and knaves always % 58.50/58.64 % lie. I landed on the island, met two inhabitants, asked one of % 58.50/58.64 % them: "Is one of you a knight?" and he answered me. What can % 58.50/58.64 % be said about the types of the asked and the other person % 58.50/58.64 % depending on the answer I get? % 58.50/58.64 % 58.50/58.64 % Refs : [Smu78] Smullyan (1978), What is the Name of This Book? The Ri % 58.50/58.64 % : [Sto95] Stolzenburg (1995), Email to Geoff Sutcliffe. % 58.50/58.64 % : [BFS95] Baumgartner et al. (1995), Model Elimination, Logic Pr % 58.50/58.64 % : [BFS97] Baumgartner et al. (1997), Computing Answers with Mode % 58.50/58.64 % Source : [Sto95] % 58.50/58.64 % Names : % 58.50/58.64 % 58.50/58.64 % Status : Unsatisfiable % 58.50/58.64 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.00 v2.1.0 % 58.50/58.64 % Syntax : Number of clauses : 9 ( 1 unt; 2 nHn; 6 RR) % 58.50/58.64 % Number of literals : 20 ( 0 equ; 11 neg) % 58.50/58.64 % Maximal clause size : 3 ( 2 avg) % 58.50/58.64 % Maximal term depth : 3 ( 1 avg) % 58.50/58.64 % Number of predicates : 2 ( 2 usr; 0 prp; 1-2 aty) % 58.50/58.64 % Number of functors : 6 ( 6 usr; 4 con; 0-2 aty) % 58.50/58.64 % Number of variables : 14 ( 4 sgn) % 58.50/58.64 % SPC : CNF_UNS_RFO_NEQ_NHN % 58.50/58.64 % 58.50/58.64 % Comments : Query allows for disjunctive answer X/Y = knave/knave ; % 58.50/58.64 % knight/knave ; knight/knight % 58.50/58.64 %-------------------------------------------------------------------------- % 58.50/58.64 %----Everyone's either a knight or a knave % 58.50/58.64 cnf(everyone_a_knight_or_knave,axiom, % 58.50/58.64 ( truth(isa(P,knight)) % 58.50/58.64 | truth(isa(P,knave)) ) ). % 58.50/58.64 % 58.50/58.64 cnf(not_both_a_knight_and_knave,axiom, % 58.50/58.64 ( ~ truth(isa(P,knight)) % 58.50/58.64 | ~ truth(isa(P,knave)) ) ). % 58.50/58.64 % 58.50/58.64 cnf(knights_make_true_statements1,axiom, % 58.50/58.64 ( truth(S) % 58.50/58.64 | ~ truth(isa(P,knight)) % 58.50/58.64 | ~ says(P,S) ) ). % 58.50/58.65 % 58.50/58.65 cnf(knights_make_true_statements2,axiom, % 58.50/58.65 ( truth(isa(P,knight)) % 58.50/58.65 | ~ truth(S) % 58.50/58.65 | ~ says(P,S) ) ). % 58.50/58.65 % 58.50/58.65 %----Definitions for or % 58.50/58.65 cnf(or1,axiom, % 58.50/58.65 ( truth(A) % 58.50/58.65 | truth(B) % 58.50/58.65 | ~ truth(or(A,B)) ) ). % 58.50/58.65 % 58.50/58.65 cnf(or2,axiom, % 58.50/58.65 ( truth(or(A,B)) % 58.50/58.65 | ~ truth(A) ) ). % 58.50/58.65 % 58.50/58.65 cnf(or3,axiom, % 58.50/58.65 ( truth(or(A,B)) % 58.50/58.65 | ~ truth(B) ) ). % 58.50/58.65 % 58.50/58.65 cnf(says_yes,axiom, % 58.50/58.65 says(asked,or(isa(asked,knight),isa(other,knight))) ). % 58.50/58.65 % 58.50/58.65 cnf(query,negated_conjecture, % 58.50/58.65 ( ~ truth(isa(asked,X)) % 58.50/58.65 | ~ truth(isa(other,Y)) ) ). % 58.50/58.65 % 58.50/58.65 %-------------------------------------------------------------------------- % 58.50/58.65 %------------------------------------------- % 58.50/58.65 % Proof found % 58.50/58.65 % SZS status Theorem for theBenchmark % 58.50/58.65 % SZS output start Proof % 58.50/58.65 %ClaNum:9(EqnAxiom:0) % 58.50/58.65 %VarNum:24(SingletonVarNum:14) % 58.50/58.65 %MaxLitNum:3 % 58.50/58.65 %MaxfuncDepth:2 % 58.50/58.65 %SharedTerms:8 % 58.50/58.65 %goalClause: 9 % 58.50/58.65 [1]P1(a1,f6(f3(a1,a2),f3(a5,a2))) % 58.50/58.65 [4]P2(f3(x41,a4))+P2(f3(x41,a2)) % 58.50/58.65 [8]~P2(f3(x81,a4))+~P2(f3(x81,a2)) % 58.50/58.65 [2]~P2(x22)+P2(f6(x21,x22)) % 58.50/58.65 [3]~P2(x31)+P2(f6(x31,x32)) % 58.50/58.65 [9]~P2(f3(a1,x91))+~P2(f3(a5,x92)) % 58.50/58.65 [5]P2(x51)+P2(x52)+~P2(f6(x52,x51)) % 58.50/58.65 [6]~P1(x61,x62)+~P2(x62)+P2(f3(x61,a2)) % 58.50/58.65 [7]P2(x71)+~P1(x72,x71)+~P2(f3(x72,a2)) % 58.50/58.65 %EqnAxiom % 58.50/58.65 % 58.50/58.65 %------------------------------------------- % 58.50/58.66 cnf(12,plain, % 58.50/58.66 (P2(f3(a1,a2))+~P2(f3(a5,x121))), % 58.50/58.66 inference(scs_inference,[],[9,4])). % 58.50/58.66 cnf(22,plain, % 58.50/58.66 (P2(f6(x221,f3(x222,a2)))+P2(f3(x222,a4))), % 58.50/58.66 inference(scs_inference,[],[2,4])). % 58.50/58.66 cnf(36,plain, % 58.50/58.66 (~P2(f3(a5,x361))+P2(f6(f3(a1,a2),x362))), % 58.50/58.66 inference(scs_inference,[],[3,12])). % 58.50/58.66 cnf(55,plain, % 58.50/58.66 (P2(f3(a5,a2))+~P2(f3(a1,x551))), % 58.50/58.66 inference(scs_inference,[],[4,9])). % 58.50/58.66 cnf(58,plain, % 58.50/58.66 (P2(f3(a5,a4))+~P2(f3(a1,x581))), % 58.50/58.66 inference(scs_inference,[],[4,9])). % 58.50/58.66 cnf(67,plain, % 58.50/58.66 (P2(f6(f3(a1,a2),x671))+P2(f3(a5,a2))), % 58.50/58.66 inference(scs_inference,[],[4,36])). % 58.50/58.66 cnf(15569,plain, % 58.50/58.66 (~P2(f6(f3(a1,a2),f3(a5,a2)))+P2(f3(a5,a2))), % 58.50/58.66 inference(scs_inference,[],[1,6,55])). % 58.50/58.66 cnf(15571,plain, % 58.50/58.66 (~P2(f6(f3(a1,a2),f3(a5,a2)))+P2(f3(a5,a4))), % 58.50/58.66 inference(scs_inference,[],[1,6,55,58])). % 58.50/58.66 cnf(15576,plain, % 58.50/58.66 (P2(f3(a5,a4))), % 58.50/58.66 inference(scs_inference,[],[15571,22])). % 58.50/58.66 cnf(15594,plain, % 58.50/58.66 ($false), % 58.50/58.66 inference(scs_inference,[],[15576,2,3,8,15569,5,67]), % 58.50/58.66 ['proof']). % 58.64/58.68 % SZS output end Proof % 58.64/58.68 % Total time :58.000000s %------------------------------------------------------------------------------