TSTP Solution File: PUZ021-1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 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 : 600s
% DateTime : Mon Jul 18 18:24:10 EDT 2022
% Result : Unsatisfiable 17.87s 18.10s
% Output : Refutation 17.87s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
cnf(not_knight_and_knave,axiom,
( ~ a_truth(knight(X9),X8)
| ~ a_truth(knave(X9),X8) ),
input ).
cnf(not_rich_and_poor,axiom,
( ~ a_truth(rich(X13),X12)
| ~ a_truth(poor(X13),X12) ),
input ).
cnf(knaves_lie1,axiom,
( ~ a_truth(knave(X30),X28)
| ~ says(X30,X29)
| ~ a_truth(X29,X28) ),
input ).
cnf(knight_or_knave,axiom,
( a_truth(knight(X11),X10)
| a_truth(knave(X11),X10) ),
input ).
cnf(knights_tell_truth1,axiom,
( ~ a_truth(knight(X22),X20)
| ~ says(X22,X21)
| a_truth(X21,X20) ),
input ).
cnf(c2,plain,
( ~ says(X40,X42)
| a_truth(X42,X41)
| a_truth(knave(X40),X41) ),
inference(resolution,status(thm),[knights_tell_truth1,knight_or_knave]) ).
cnf(knaves_lie2,axiom,
( ~ a_truth(knave(X39),X37)
| says(X39,X38)
| a_truth(X38,X37) ),
input ).
cnf(conjunction1,axiom,
( ~ a_truth(and(X4,X3),X2)
| a_truth(X4,X2) ),
input ).
cnf(prove_statement_exists2,negated_conjecture,
( says(me,X73)
| a_truth(and(knave(me),rich(me)),X73) ),
input ).
cnf(c73,plain,
( says(me,X76)
| a_truth(knave(me),X76) ),
inference(resolution,status(thm),[prove_statement_exists2,conjunction1]) ).
cnf(c85,plain,
( says(me,X90)
| says(me,X89)
| a_truth(X89,X90) ),
inference(resolution,status(thm),[c73,knaves_lie2]) ).
cnf(c107,plain,
( says(me,X94)
| a_truth(X94,X94) ),
inference(factor,status(thm),[c85]) ).
cnf(c141,plain,
( a_truth(X112,X112)
| a_truth(X112,X113)
| a_truth(knave(me),X113) ),
inference(resolution,status(thm),[c107,c2]) ).
cnf(c217,plain,
a_truth(knave(me),knave(me)),
inference(factor,status(thm),[c141]) ).
cnf(c263,plain,
( ~ says(me,X120)
| ~ a_truth(X120,knave(me)) ),
inference(resolution,status(thm),[c217,knaves_lie1]) ).
cnf(conjunction2,axiom,
( ~ a_truth(and(X7,X6),X5)
| a_truth(X6,X5) ),
input ).
cnf(c71,plain,
( says(me,X75)
| a_truth(rich(me),X75) ),
inference(resolution,status(thm),[prove_statement_exists2,conjunction2]) ).
cnf(c84,plain,
( says(me,X85)
| ~ says(me,X86)
| ~ a_truth(X86,X85) ),
inference(resolution,status(thm),[c73,knaves_lie1]) ).
cnf(c97,plain,
( says(me,X88)
| ~ says(me,knave(me)) ),
inference(resolution,status(thm),[c84,c73]) ).
cnf(c106,plain,
( says(me,X105)
| a_truth(rich(me),knave(me)) ),
inference(resolution,status(thm),[c97,c71]) ).
cnf(c337,plain,
~ says(me,knave(me)),
inference(resolution,status(thm),[c263,c217]) ).
cnf(c368,plain,
a_truth(rich(me),knave(me)),
inference(resolution,status(thm),[c337,c106]) ).
cnf(c383,plain,
~ says(me,rich(me)),
inference(resolution,status(thm),[c368,c263]) ).
cnf(rich_or_poor,axiom,
( a_truth(rich(X15),X14)
| a_truth(poor(X15),X14) ),
input ).
cnf(knights_tell_truth2,axiom,
( ~ a_truth(knight(X25),X23)
| says(X25,X24)
| ~ a_truth(X24,X23) ),
input ).
cnf(c4,plain,
( says(X47,X46)
| ~ a_truth(X46,X48)
| a_truth(knave(X47),X48) ),
inference(resolution,status(thm),[knights_tell_truth2,knight_or_knave]) ).
cnf(c21,plain,
( says(X137,rich(X136))
| a_truth(knave(X137),X135)
| a_truth(poor(X136),X135) ),
inference(resolution,status(thm),[c4,rich_or_poor]) ).
cnf(c500,plain,
( a_truth(knave(me),X187)
| a_truth(poor(me),X187) ),
inference(resolution,status(thm),[c21,c383]) ).
cnf(c809,plain,
( a_truth(knave(me),X195)
| ~ a_truth(rich(me),X195) ),
inference(resolution,status(thm),[c500,not_rich_and_poor]) ).
cnf(c216,plain,
( a_truth(X117,X117)
| a_truth(knave(me),X117) ),
inference(factor,status(thm),[c141]) ).
cnf(c308,plain,
( a_truth(knave(me),and(X1740,X1741))
| a_truth(X1740,and(X1740,X1741)) ),
inference(resolution,status(thm),[c216,conjunction1]) ).
cnf(c32023,plain,
a_truth(knave(me),and(rich(me),X1743)),
inference(resolution,status(thm),[c308,c809]) ).
cnf(c32119,plain,
~ a_truth(knight(me),and(rich(me),X1750)),
inference(resolution,status(thm),[c32023,not_knight_and_knave]) ).
cnf(c317,plain,
( a_truth(X164,X164)
| says(me,X163)
| a_truth(X163,X164) ),
inference(resolution,status(thm),[c216,knaves_lie2]) ).
cnf(c674,plain,
( a_truth(X170,X170)
| a_truth(rich(me),X170) ),
inference(resolution,status(thm),[c317,c383]) ).
cnf(prove_statement_exists1,negated_conjecture,
( ~ says(me,X60)
| ~ a_truth(and(knave(me),rich(me)),X60) ),
input ).
cnf(conjunction3,axiom,
( a_truth(and(X45,X44),X43)
| ~ a_truth(X45,X43)
| ~ a_truth(X44,X43) ),
input ).
cnf(c16,plain,
( a_truth(and(X114,rich(X115)),X116)
| ~ a_truth(X114,X116)
| a_truth(poor(X115),X116) ),
inference(resolution,status(thm),[conjunction3,rich_or_poor]) ).
cnf(c315,plain,
( a_truth(X1763,X1763)
| a_truth(and(knave(me),rich(X1762)),X1763)
| a_truth(poor(X1762),X1763) ),
inference(resolution,status(thm),[c216,c16]) ).
cnf(c32961,plain,
( a_truth(X1957,X1957)
| a_truth(poor(me),X1957)
| ~ says(me,X1957) ),
inference(resolution,status(thm),[c315,prove_statement_exists1]) ).
cnf(c39071,plain,
( a_truth(X1964,X1964)
| a_truth(poor(me),X1964) ),
inference(resolution,status(thm),[c32961,c107]) ).
cnf(c40014,plain,
( a_truth(X1979,X1979)
| ~ a_truth(rich(me),X1979) ),
inference(resolution,status(thm),[c39071,not_rich_and_poor]) ).
cnf(c40987,plain,
a_truth(X1980,X1980),
inference(resolution,status(thm),[c40014,c674]) ).
cnf(c41057,plain,
a_truth(X1981,and(X1982,X1981)),
inference(resolution,status(thm),[c40987,conjunction2]) ).
cnf(c41142,plain,
$false,
inference(resolution,status(thm),[c41057,c32119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat May 28 21:46:51 EDT 2022
% 0.19/0.34 % CPUTime :
% 17.87/18.10 # Version: 1.3
% 17.87/18.10 # SZS status Unsatisfiable
% 17.87/18.10 # SZS output start CNFRefutation
% See solution above
% 17.87/18.10
% 17.87/18.10 # Initial clauses : 13
% 17.87/18.10 # Processed clauses : 482
% 17.87/18.10 # Factors computed : 164
% 17.87/18.10 # Resolvents computed: 41277
% 17.87/18.10 # Tautologies deleted: 55
% 17.87/18.10 # Forward subsumed : 1197
% 17.87/18.10 # Backward subsumed : 110
% 17.87/18.10 # -------- CPU Time ---------
% 17.87/18.10 # User time : 17.628 s
% 17.87/18.10 # System time : 0.096 s
% 17.87/18.10 # Total time : 17.724 s
%------------------------------------------------------------------------------