TSTP Solution File: PUZ035-5 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : PUZ035-5 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n001.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:11:01 EDT 2023
% Result : Unsatisfiable 0.20s 0.66s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ035-5 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n001.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:35:16 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.59 start to proof:theBenchmark
% 0.20/0.66 %-------------------------------------------
% 0.20/0.66 % File :CSE---1.6
% 0.20/0.66 % Problem :theBenchmark
% 0.20/0.66 % Transform :cnf
% 0.20/0.66 % Format :tptp:raw
% 0.20/0.66 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.66
% 0.20/0.66 % Result :Theorem 0.020000s
% 0.20/0.66 % Output :CNFRefutation 0.020000s
% 0.20/0.66 %-------------------------------------------
% 0.20/0.66 %--------------------------------------------------------------------------
% 0.20/0.66 % File : PUZ035-5 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.66 % Domain : Puzzles
% 0.20/0.66 % Problem : Knights and Knaves #36
% 0.20/0.66 % Version : [Sto95] axioms.
% 0.20/0.66 % Theorem formulation : Definite answer "yes".
% 0.20/0.66 % English : On an island, there live exactly two types of people: knights
% 0.20/0.66 % and knaves. Knights always tell the truth and knaves always
% 0.20/0.66 % lie. I landed on the island, met two inhabitants, asked one of
% 0.20/0.66 % them: "Is one of you a knight?" and he answered me. What can
% 0.20/0.66 % be said about the types of the asked and the other person
% 0.20/0.66 % depending on the answer I get?
% 0.20/0.66
% 0.20/0.66 % Refs : [Smu78] Smullyan (1978), What is the Name of This Book? The Ri
% 0.20/0.66 % : [Sto95] Stolzenburg (1995), Email to Geoff Sutcliffe.
% 0.20/0.66 % : [BFS95] Baumgartner et al. (1995), Model Elimination, Logic Pr
% 0.20/0.66 % : [BFS97] Baumgartner et al. (1997), Computing Answers with Mode
% 0.20/0.66 % Source : [Sto95]
% 0.20/0.66 % Names :
% 0.20/0.66
% 0.20/0.66 % Status : Unsatisfiable
% 0.20/0.66 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.00 v2.1.0
% 0.20/0.66 % Syntax : Number of clauses : 9 ( 1 unt; 2 nHn; 6 RR)
% 0.20/0.66 % Number of literals : 20 ( 0 equ; 11 neg)
% 0.20/0.66 % Maximal clause size : 3 ( 2 avg)
% 0.20/0.66 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.66 % Number of predicates : 2 ( 2 usr; 0 prp; 1-2 aty)
% 0.20/0.66 % Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% 0.20/0.66 % Number of variables : 14 ( 4 sgn)
% 0.20/0.66 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.66
% 0.20/0.66 % Comments : Query allows for disjunctive answer X/Y = knave/knave ;
% 0.20/0.66 % knight/knave ; knight/knight
% 0.20/0.66 %--------------------------------------------------------------------------
% 0.20/0.66 %----Everyone's either a knight or a knave
% 0.20/0.66 cnf(everyone_a_knight_or_knave,axiom,
% 0.20/0.66 ( truth(isa(P,knight))
% 0.20/0.66 | truth(isa(P,knave)) ) ).
% 0.20/0.66
% 0.20/0.66 cnf(not_both_a_knight_and_knave,axiom,
% 0.20/0.66 ( ~ truth(isa(P,knight))
% 0.20/0.66 | ~ truth(isa(P,knave)) ) ).
% 0.20/0.66
% 0.20/0.66 cnf(knights_make_true_statements1,axiom,
% 0.20/0.66 ( truth(S)
% 0.20/0.66 | ~ truth(isa(P,knight))
% 0.20/0.66 | ~ says(P,S) ) ).
% 0.20/0.66
% 0.20/0.66 cnf(knights_make_true_statements2,axiom,
% 0.20/0.66 ( truth(isa(P,knight))
% 0.20/0.66 | ~ truth(S)
% 0.20/0.66 | ~ says(P,S) ) ).
% 0.20/0.66
% 0.20/0.66 %----Definitions for or
% 0.20/0.66 cnf(or1,axiom,
% 0.20/0.66 ( truth(A)
% 0.20/0.66 | truth(B)
% 0.20/0.66 | ~ truth(or(A,B)) ) ).
% 0.20/0.66
% 0.20/0.66 cnf(or2,axiom,
% 0.20/0.66 ( truth(or(A,B))
% 0.20/0.66 | ~ truth(A) ) ).
% 0.20/0.66
% 0.20/0.66 cnf(or3,axiom,
% 0.20/0.66 ( truth(or(A,B))
% 0.20/0.66 | ~ truth(B) ) ).
% 0.20/0.66
% 0.20/0.66 cnf(says_yes,axiom,
% 0.20/0.66 says(asked,or(isa(asked,knight),isa(other,knight))) ).
% 0.20/0.66
% 0.20/0.66 cnf(query,negated_conjecture,
% 0.20/0.66 ( ~ truth(isa(asked,X))
% 0.20/0.66 | ~ truth(isa(other,Y)) ) ).
% 0.20/0.66
% 0.20/0.66 %--------------------------------------------------------------------------
% 0.20/0.66 %-------------------------------------------
% 0.20/0.66 % Proof found
% 0.20/0.66 % SZS status Theorem for theBenchmark
% 0.20/0.66 % SZS output start Proof
% 0.20/0.66 %ClaNum:9(EqnAxiom:0)
% 0.20/0.66 %VarNum:24(SingletonVarNum:14)
% 0.20/0.66 %MaxLitNum:3
% 0.20/0.66 %MaxfuncDepth:2
% 0.20/0.66 %SharedTerms:8
% 0.20/0.66 %goalClause: 9
% 0.20/0.66 [1]P1(a1,f6(f3(a1,a2),f3(a5,a2)))
% 0.20/0.66 [4]P2(f3(x41,a4))+P2(f3(x41,a2))
% 0.20/0.66 [8]~P2(f3(x81,a4))+~P2(f3(x81,a2))
% 0.20/0.66 [2]~P2(x22)+P2(f6(x21,x22))
% 0.20/0.66 [3]~P2(x31)+P2(f6(x31,x32))
% 0.20/0.66 [9]~P2(f3(a1,x91))+~P2(f3(a5,x92))
% 0.20/0.66 [5]P2(x51)+P2(x52)+~P2(f6(x52,x51))
% 0.20/0.66 [6]~P1(x61,x62)+~P2(x62)+P2(f3(x61,a2))
% 0.20/0.66 [7]P2(x71)+~P1(x72,x71)+~P2(f3(x72,a2))
% 0.20/0.66 %EqnAxiom
% 0.20/0.66
% 0.20/0.66 %-------------------------------------------
% 0.20/0.66 cnf(10,plain,
% 0.20/0.66 (~P2(f6(f3(a1,a2),f3(a5,a2)))+P2(f3(a1,a2))),
% 0.20/0.66 inference(scs_inference,[],[1,6])).
% 0.20/0.66 cnf(13,plain,
% 0.20/0.66 (~P2(f6(f3(a1,a2),f3(a5,a2)))+~P2(f3(a5,x131))),
% 0.20/0.66 inference(scs_inference,[],[9,10])).
% 0.20/0.66 cnf(15,plain,
% 0.20/0.66 (~P2(f3(a5,a2))+~P2(f3(a5,x151))),
% 0.20/0.66 inference(scs_inference,[],[13,2])).
% 0.20/0.67 cnf(16,plain,
% 0.20/0.67 (~P2(f3(a5,a2))),
% 0.20/0.67 inference(factoring_inference,[],[15])).
% 0.20/0.67 cnf(23,plain,
% 0.20/0.67 (~P2(f6(f3(a1,a2),f3(a5,a2)))),
% 0.20/0.67 inference(scs_inference,[],[16,4,5,6,13])).
% 0.20/0.67 cnf(25,plain,
% 0.20/0.67 (~P2(f3(a1,x251))),
% 0.20/0.67 inference(scs_inference,[],[16,4,5,6,13,9])).
% 0.20/0.67 cnf(35,plain,
% 0.20/0.67 ($false),
% 0.20/0.67 inference(scs_inference,[],[1,23,25,4,7]),
% 0.20/0.67 ['proof']).
% 0.20/0.67 % SZS output end Proof
% 0.20/0.67 % Total time :0.020000s
%------------------------------------------------------------------------------