TSTP Solution File: PUZ020-1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : PUZ020-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n024.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:55 EDT 2023

% Result   : Unsatisfiable 0.21s 0.65s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : PUZ020-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35  % Computer : n024.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:36:08 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.21/0.58  start to proof:theBenchmark
% 0.21/0.64  %-------------------------------------------
% 0.21/0.64  % File        :CSE---1.6
% 0.21/0.64  % Problem     :theBenchmark
% 0.21/0.64  % Transform   :cnf
% 0.21/0.64  % Format      :tptp:raw
% 0.21/0.64  % Command     :java -jar mcs_scs.jar %d %s
% 0.21/0.64  
% 0.21/0.64  % Result      :Theorem 0.000000s
% 0.21/0.64  % Output      :CNFRefutation 0.000000s
% 0.21/0.64  %-------------------------------------------
% 0.21/0.64  %--------------------------------------------------------------------------
% 0.21/0.64  % File     : PUZ020-1 : TPTP v8.1.2. Released v1.0.0.
% 0.21/0.64  % Domain   : Puzzles
% 0.21/0.64  % Problem  : A knights & knaves problem, if he's a knight, so is she
% 0.21/0.64  % Version  : Especial.
% 0.21/0.64  % English  :
% 0.21/0.64  
% 0.21/0.64  % Refs     : [Rap95] Raptis (1995), Email to G. Sutcliffe
% 0.21/0.64  % Source   : [ANL]
% 0.21/0.64  % Names    : knightknave.in [ANL]
% 0.21/0.64  
% 0.21/0.64  % Status   : Unsatisfiable
% 0.21/0.64  % Rating   : 0.05 v8.1.0, 0.00 v5.3.0, 0.06 v5.2.0, 0.00 v2.0.0
% 0.21/0.64  % Syntax   : Number of clauses     :   19 (   5 unt;   3 nHn;  19 RR)
% 0.21/0.64  %            Number of literals    :   41 (   4 equ;  25 neg)
% 0.21/0.64  %            Maximal clause size   :    3 (   2 avg)
% 0.21/0.64  %            Maximal term depth    :    2 (   1 avg)
% 0.21/0.64  %            Number of predicates  :    6 (   5 usr;   0 prp; 1-2 aty)
% 0.21/0.64  %            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
% 0.21/0.64  %            Number of variables   :   16 (   2 sgn)
% 0.21/0.64  % SPC      : CNF_UNS_RFO_SEQ_NHN
% 0.21/0.64  
% 0.21/0.64  % Comments : Dimitris Raptis [Rap95] has pointed out that the clause
% 0.21/0.64  %            statements_are_true_or_not is a tautology. Does your ATP system
% 0.21/0.64  %            ignore it?
% 0.21/0.64  %--------------------------------------------------------------------------
% 0.21/0.64  %----This axiom is omitted in the orginal, because of paramodulation
% 0.21/0.64  %----Everyone's either a knight or a knave; statements are true or false.
% 0.21/0.64  cnf(everyone_a_knight_or_knave,axiom,
% 0.21/0.64      ( ~ person(X)
% 0.21/0.64      | knight(X)
% 0.21/0.64      | knave(X) ) ).
% 0.21/0.64  
% 0.21/0.64  cnf(not_both_a_knight_and_knave,axiom,
% 0.21/0.64      ( ~ person(X)
% 0.21/0.64      | ~ knight(X)
% 0.21/0.64      | ~ knave(X) ) ).
% 0.21/0.64  
% 0.21/0.64  cnf(statements_are_true_or_false,axiom,
% 0.21/0.64      ( ~ says(X,Y)
% 0.21/0.64      | a_truth(Y)
% 0.21/0.64      | ~ a_truth(Y) ) ).
% 0.21/0.64  
% 0.21/0.64  %----Rules about statements
% 0.21/0.64  cnf(people_do_not_equal_their_statements1,axiom,
% 0.21/0.64      ( ~ says(X,Y)
% 0.21/0.64      | X != Y ) ).
% 0.21/0.64  
% 0.21/0.64  cnf(peoples_statements,axiom,
% 0.21/0.64      ( ~ says(X,Y)
% 0.21/0.64      | Y = statement_by(X) ) ).
% 0.21/0.64  
% 0.21/0.64  cnf(people_do_not_equal_their_statement2,axiom,
% 0.21/0.64      ( ~ person(X)
% 0.21/0.64      | X != statement_by(Y) ) ).
% 0.21/0.64  
% 0.21/0.64  cnf(knights_make_true_statements,axiom,
% 0.21/0.64      ( ~ person(X)
% 0.21/0.64      | ~ a_truth(statement_by(X))
% 0.21/0.64      | knight(X) ) ).
% 0.21/0.64  
% 0.21/0.64  cnf(knaves_make_false_statements,axiom,
% 0.21/0.64      ( ~ person(X)
% 0.21/0.64      | a_truth(statement_by(X))
% 0.21/0.64      | knave(X) ) ).
% 0.21/0.64  
% 0.21/0.64  %----What knights say is true, what knaves say is false
% 0.21/0.64  cnf(knights_say_the_truth,axiom,
% 0.21/0.64      ( ~ knight(X)
% 0.21/0.64      | ~ says(X,Y)
% 0.21/0.64      | a_truth(Y) ) ).
% 0.21/0.64  
% 0.21/0.64  cnf(knaves_do_not_say_the_truth,axiom,
% 0.21/0.65      ( ~ knave(X)
% 0.21/0.65      | ~ says(X,Y)
% 0.21/0.65      | ~ a_truth(Y) ) ).
% 0.21/0.65  
% 0.21/0.65  %----This is for the husband & wife problem; if he's a knight, then she
% 0.21/0.65  %----is
% 0.21/0.65  cnf(husband,hypothesis,
% 0.21/0.65      person(husband) ).
% 0.21/0.65  
% 0.21/0.65  cnf(wife,hypothesis,
% 0.21/0.65      person(wife) ).
% 0.21/0.65  
% 0.21/0.65  cnf(husband_not_wife,hypothesis,
% 0.21/0.65      husband != wife ).
% 0.21/0.65  
% 0.21/0.65  cnf(husband_makes_statements,hypothesis,
% 0.21/0.65      says(husband,statement_by(husband)) ).
% 0.21/0.65  
% 0.21/0.65  cnf(truthful_knight_husband_means_knight_wife,hypothesis,
% 0.21/0.65      ( ~ a_truth(statement_by(husband))
% 0.21/0.65      | ~ knight(husband)
% 0.21/0.65      | knight(wife) ) ).
% 0.21/0.65  
% 0.21/0.65  cnf(knight_husband_makes_true_statements,hypothesis,
% 0.21/0.65      ( a_truth(statement_by(husband))
% 0.21/0.65      | ~ knight(husband) ) ).
% 0.21/0.65  
% 0.21/0.65  cnf(knight_wife_or_truthful_husband,hypothesis,
% 0.21/0.65      ( a_truth(statement_by(husband))
% 0.21/0.65      | knight(wife) ) ).
% 0.21/0.65  
% 0.21/0.65  cnf(knight_wife_means_truthful_husband,hypothesis,
% 0.21/0.65      ( ~ knight(wife)
% 0.21/0.65      | a_truth(statement_by(husband)) ) ).
% 0.21/0.65  
% 0.21/0.65  cnf(prove_knight_husband,negated_conjecture,
% 0.21/0.65      ~ knight(husband) ).
% 0.21/0.65  
% 0.21/0.65  %--------------------------------------------------------------------------
% 0.21/0.65  %-------------------------------------------
% 0.21/0.65  % Proof found
% 0.21/0.65  % SZS status Theorem for theBenchmark
% 0.21/0.65  % SZS output start Proof
% 0.21/0.65  %ClaNum:28(EqnAxiom:10)
% 0.21/0.65  %VarNum:31(SingletonVarNum:14)
% 0.21/0.65  %MaxLitNum:3
% 0.21/0.65  %MaxfuncDepth:1
% 0.21/0.65  %SharedTerms:12
% 0.21/0.65  %goalClause: 15
% 0.21/0.65  %singleGoalClaCount:1
% 0.21/0.65  [11]P1(a1)
% 0.21/0.65  [12]P1(a2)
% 0.21/0.65  [14]~E(a1,a2)
% 0.21/0.65  [15]~P2(a1)
% 0.21/0.65  [13]P5(a1,f3(a1))
% 0.21/0.65  [16]P2(a2)+P3(f3(a1))
% 0.21/0.65  [18]~P2(a2)+P3(f3(a1))
% 0.21/0.65  [24]~P5(x241,x242)+~E(x241,x242)
% 0.21/0.65  [19]~P1(x191)+~E(x191,f3(x192))
% 0.21/0.65  [25]~P5(x252,x251)+E(x251,f3(x252))
% 0.21/0.65  [20]P4(x201)+~P1(x201)+P2(x201)
% 0.21/0.65  [22]~P2(x221)+~P4(x221)+~P1(x221)
% 0.21/0.65  [23]~P1(x231)+P4(x231)+P3(f3(x231))
% 0.21/0.65  [26]~P1(x261)+P2(x261)+~P3(f3(x261))
% 0.21/0.65  [27]~P5(x272,x271)+P3(x271)+~P2(x272)
% 0.21/0.65  [28]~P5(x281,x282)+~P4(x281)+~P3(x282)
% 0.21/0.65  %EqnAxiom
% 0.21/0.65  [1]E(x11,x11)
% 0.21/0.65  [2]E(x22,x21)+~E(x21,x22)
% 0.21/0.65  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.21/0.65  [4]~E(x41,x42)+E(f3(x41),f3(x42))
% 0.21/0.65  [5]~P1(x51)+P1(x52)+~E(x51,x52)
% 0.21/0.65  [6]P5(x62,x63)+~E(x61,x62)+~P5(x61,x63)
% 0.21/0.65  [7]P5(x73,x72)+~E(x71,x72)+~P5(x73,x71)
% 0.21/0.65  [8]~P3(x81)+P3(x82)+~E(x81,x82)
% 0.21/0.65  [9]~P2(x91)+P2(x92)+~E(x91,x92)
% 0.21/0.65  [10]~P4(x101)+P4(x102)+~E(x101,x102)
% 0.21/0.65  
% 0.21/0.65  %-------------------------------------------
% 0.21/0.65  cnf(36,plain,
% 0.21/0.65     (~P3(f3(a1))),
% 0.21/0.65     inference(scs_inference,[],[15,11,14,13,20,2,24,19,10,26])).
% 0.21/0.65  cnf(38,plain,
% 0.21/0.65     (~P2(a2)),
% 0.21/0.65     inference(scs_inference,[],[15,11,14,13,20,2,24,19,10,26,18])).
% 0.21/0.65  cnf(39,plain,
% 0.21/0.65     (~P5(a1,a1)),
% 0.21/0.65     inference(scs_inference,[],[15,11,14,13,20,2,24,19,10,26,18,16,25])).
% 0.21/0.65  cnf(52,plain,
% 0.21/0.65     ($false),
% 0.21/0.65     inference(scs_inference,[],[12,13,36,38,39,7,20,16]),
% 0.21/0.65     ['proof']).
% 0.21/0.65  % SZS output end Proof
% 0.21/0.65  % Total time :0.000000s
%------------------------------------------------------------------------------