%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : PUZ009-1 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n007.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:02 EDT 2024 % Result : Unsatisfiable 0.54s 0.61s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : PUZ009-1 : TPTP v8.2.0. Released v1.0.0. % 0.04/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n007.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 : Tue Jun 18 10:55:24 EDT 2024 % 0.13/0.34 % CPUTime : % 0.54/0.57 start to proof:theBenchmark % 0.54/0.61 %------------------------------------------- % 0.54/0.61 % File :CSE---1.7 % 0.54/0.61 % Problem :theBenchmark % 0.54/0.61 % Transform :cnf % 0.54/0.61 % Format :tptp:raw % 0.54/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.54/0.61 % 0.54/0.61 % Result :Theorem 0.000000s % 0.54/0.61 % Output :CNFRefutation 0.000000s % 0.54/0.61 %------------------------------------------- % 0.54/0.61 %-------------------------------------------------------------------------- % 0.54/0.61 % File : PUZ009-1 : TPTP v8.2.0. Released v1.0.0. % 0.54/0.61 % Domain : Puzzles % 0.54/0.61 % Problem : Looking for Oona % 0.54/0.61 % Version : Especial. % 0.54/0.61 % English : In another curious incident, when the husband arrived on an % 0.54/0.61 % island looking for Oona, he met 5 natives A,B,C,D,E who all % 0.54/0.61 % guessed his purpose and grinned at meeting him. They said: % 0.54/0.61 % A: Oona is on this island. B: Oona is not on this island. % 0.54/0.61 % C: Oona was here yesterday. D: Oona is not here today, and she % 0.54/0.61 % was not here yesterday. E: Either D is a knave or C is a knight. % 0.54/0.61 % The logician thought for a while, but could get nowhere. `Won't % 0.54/0.61 % one of you please make another statement?' the logician pleaded. % 0.54/0.61 % At this point A said: Either E is a knave or C is a knight. Is % 0.54/0.61 % Oona on the island?" % 0.54/0.61 % 0.54/0.61 % Refs : [Smu87] Smullyan (1987), Forever Undecided - A Puzzle Guide to % 0.54/0.61 % Source : [ANL] % 0.54/0.61 % Names : oona.in [ANL] % 0.54/0.61 % 0.54/0.61 % Status : Unsatisfiable % 0.54/0.61 % Rating : 0.00 v2.0.0 % 0.54/0.61 % Syntax : Number of clauses : 18 ( 1 unt; 6 nHn; 18 RR) % 0.54/0.61 % Number of literals : 40 ( 0 equ; 21 neg) % 0.54/0.61 % Maximal clause size : 3 ( 2 avg) % 0.54/0.61 % Maximal term depth : 0 ( 0 avg) % 0.54/0.61 % Number of predicates : 5 ( 5 usr; 5 prp; 0-0 aty) % 0.54/0.61 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.54/0.61 % Number of variables : 0 ( 0 sgn) % 0.54/0.61 % SPC : CNF_UNS_PRP % 0.54/0.61 % 0.54/0.61 % Comments : % 0.54/0.61 %-------------------------------------------------------------------------- % 0.54/0.61 cnf(c1,axiom, % 0.54/0.61 ( ~ a_is_a_knight % 0.54/0.61 | ~ b_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c2,axiom, % 0.54/0.61 ( ~ a_is_a_knight % 0.54/0.61 | ~ d_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c3,axiom, % 0.54/0.61 ( ~ b_is_a_knight % 0.54/0.61 | ~ a_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c4,axiom, % 0.54/0.61 ( b_is_a_knight % 0.54/0.61 | a_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c5,axiom, % 0.54/0.61 ( ~ b_is_a_knight % 0.54/0.61 | c_is_a_knight % 0.54/0.61 | d_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c6,axiom, % 0.54/0.61 ( ~ c_is_a_knight % 0.54/0.61 | ~ d_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c7,axiom, % 0.54/0.61 ( ~ d_is_a_knight % 0.54/0.61 | ~ a_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c8,axiom, % 0.54/0.61 ( ~ d_is_a_knight % 0.54/0.61 | b_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c9,axiom, % 0.54/0.61 ( ~ d_is_a_knight % 0.54/0.61 | ~ c_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c10,axiom, % 0.54/0.61 ( ~ e_is_a_knight % 0.54/0.61 | ~ d_is_a_knight % 0.54/0.61 | c_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c11,axiom, % 0.54/0.61 ( e_is_a_knight % 0.54/0.61 | d_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c12,axiom, % 0.54/0.61 ( e_is_a_knight % 0.54/0.61 | ~ c_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c13,axiom, % 0.54/0.61 ( d_is_a_knight % 0.54/0.61 | a_is_a_knight % 0.54/0.61 | c_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c14,axiom, % 0.54/0.61 ( d_is_a_knight % 0.54/0.61 | ~ b_is_a_knight % 0.54/0.61 | c_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c15,axiom, % 0.54/0.61 ( ~ a_is_a_knight % 0.54/0.61 | ~ e_is_a_knight % 0.54/0.61 | c_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c16,axiom, % 0.54/0.61 ( a_is_a_knight % 0.54/0.61 | e_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c17,axiom, % 0.54/0.61 ( a_is_a_knight % 0.54/0.61 | ~ c_is_a_knight ) ). % 0.54/0.61 % 0.54/0.61 cnf(c18,negated_conjecture, % 0.54/0.61 b_is_a_knight ). % 0.54/0.61 % 0.54/0.61 %-------------------------------------------------------------------------- % 0.54/0.61 %------------------------------------------- % 0.54/0.61 % Proof found % 0.54/0.61 % SZS status Theorem for theBenchmark % 0.54/0.61 % SZS output start Proof % 0.54/0.61 %ClaNum:18(EqnAxiom:0) % 0.54/0.61 %VarNum:0(SingletonVarNum:0) % 0.54/0.61 %MaxLitNum:3 % 0.54/0.61 %MaxfuncDepth:0 % 0.54/0.61 %SharedTerms:11 % 0.54/0.61 %goalClause: 1 % 0.54/0.61 %singleGoalClaCount:1 % 0.54/0.61 [1]P1(a5000) % 0.54/0.61 [3]P2(a5000)+P3(a5000) % 0.54/0.61 [4]P4(a5000)+P3(a5000) % 0.54/0.61 [5]P2(a5000)+~P5(a5000) % 0.54/0.61 [7]P3(a5000)+~P5(a5000) % 0.54/0.61 [10]~P2(a5000)+~P1(a5000) % 0.54/0.61 [12]~P2(a5000)+~P4(a5000) % 0.54/0.61 [14]~P4(a5000)+~P5(a5000) % 0.54/0.61 [8]P2(a5000)+P4(a5000)+P5(a5000) % 0.54/0.61 [16]P4(a5000)+P5(a5000)+~P1(a5000) % 0.54/0.61 [17]P5(a5000)+~P2(a5000)+~P3(a5000) % 0.54/0.61 [18]P5(a5000)+~P4(a5000)+~P3(a5000) % 0.54/0.61 %EqnAxiom % 0.54/0.61 % 0.54/0.61 %------------------------------------------- % 0.54/0.62 cnf(19,plain, % 0.54/0.62 (~P2(a5000)), % 0.54/0.62 inference(scs_inference,[],[1,10])). % 0.54/0.62 cnf(20,plain, % 0.54/0.62 (P4(a5000)+P5(a5000)), % 0.54/0.62 inference(scs_inference,[],[1,16])). % 0.54/0.62 cnf(21,plain, % 0.54/0.62 (P3(a5000)), % 0.54/0.62 inference(scs_inference,[],[19,3])). % 0.54/0.62 cnf(22,plain, % 0.54/0.62 (~P5(a5000)), % 0.54/0.62 inference(scs_inference,[],[19,5])). % 0.54/0.62 cnf(25,plain, % 0.54/0.62 (~P4(a5000)), % 0.54/0.62 inference(scs_inference,[],[22,21,18])). % 0.54/0.62 cnf(26,plain, % 0.54/0.62 (P4(a5000)), % 0.54/0.62 inference(scs_inference,[],[22,20])). % 0.54/0.62 cnf(27,plain, % 0.54/0.62 ($false), % 0.54/0.62 inference(scs_inference,[],[26,25]), % 0.54/0.62 ['proof']). % 0.54/0.62 % SZS output end Proof % 0.54/0.62 % Total time :0.000000s %------------------------------------------------------------------------------