TSTP Solution File: PUZ035-6 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PUZ035-6 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n029.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:12:17 EDT 2023
% Result : Unsatisfiable 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 15 ( 2 unt; 9 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 5 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
knight: $i ).
tff(decl_23,type,
isa: ( $i * $i ) > $i ).
tff(decl_24,type,
truth: $i > $o ).
tff(decl_25,type,
knave: $i ).
tff(decl_26,type,
says: ( $i * $i ) > $o ).
tff(decl_27,type,
or: ( $i * $i ) > $i ).
tff(decl_28,type,
not: $i > $i ).
tff(decl_29,type,
asked: $i ).
tff(decl_30,type,
other: $i ).
cnf(query,negated_conjecture,
( ~ truth(isa(asked,X1))
| ~ truth(isa(other,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query) ).
cnf(everyone_a_knight_or_knave,axiom,
( truth(isa(X1,knight))
| truth(isa(X1,knave)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',everyone_a_knight_or_knave) ).
cnf(c_0_2,negated_conjecture,
( ~ truth(isa(asked,X1))
| ~ truth(isa(other,X2)) ),
query ).
cnf(c_0_3,axiom,
( truth(isa(X1,knight))
| truth(isa(X1,knave)) ),
everyone_a_knight_or_knave ).
cnf(c_0_4,negated_conjecture,
~ truth(isa(other,X1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_3]),c_0_2]) ).
cnf(c_0_5,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_3]),c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ035-6 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.17/0.35 % Computer : n029.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Sat Aug 26 22:48:55 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.55 start to proof: theBenchmark
% 0.20/0.57 % Version : CSE_E---1.5
% 0.20/0.57 % Problem : theBenchmark.p
% 0.20/0.57 % Proof found
% 0.20/0.57 % SZS status Theorem for theBenchmark.p
% 0.20/0.57 % SZS output start Proof
% See solution above
% 0.20/0.57 % Total time : 0.004000 s
% 0.20/0.57 % SZS output end Proof
% 0.20/0.57 % Total time : 0.007000 s
%------------------------------------------------------------------------------