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