TSTP Solution File: PUZ020-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ020-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n018.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 : Tue Aug 22 10:54:01 EDT 2023
% Result : Unsatisfiable 3.14s 2.06s
% Output : CNFRefutation 3.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 34 ( 16 unt; 8 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 6 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ says > person > knight > knave > a_truth > #nlpp > statement_by > wife > husband
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(wife,type,
wife: $i ).
tff(says,type,
says: ( $i * $i ) > $o ).
tff(knave,type,
knave: $i > $o ).
tff(knight,type,
knight: $i > $o ).
tff(husband,type,
husband: $i ).
tff(a_truth,type,
a_truth: $i > $o ).
tff(statement_by,type,
statement_by: $i > $i ).
tff(person,type,
person: $i > $o ).
tff(f_127,axiom,
~ knight(husband),
file(unknown,unknown) ).
tff(f_103,axiom,
person(husband),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X] :
( ~ person(X)
| knight(X)
| knave(X) ),
file(unknown,unknown) ).
tff(f_121,axiom,
( a_truth(statement_by(husband))
| knight(wife) ),
file(unknown,unknown) ).
tff(f_107,axiom,
says(husband,statement_by(husband)),
file(unknown,unknown) ).
tff(f_100,axiom,
! [X,Y] :
( ~ knave(X)
| ~ says(X,Y)
| ~ a_truth(Y) ),
file(unknown,unknown) ).
tff(f_125,axiom,
( ~ knight(wife)
| a_truth(statement_by(husband)) ),
file(unknown,unknown) ).
tff(c_38,plain,
~ knight(husband),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_22,plain,
person(husband),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_59,plain,
! [X_22] :
( knave(X_22)
| knight(X_22)
| ~ person(X_22) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_62,plain,
( knave(husband)
| knight(husband) ),
inference(resolution,[status(thm)],[c_22,c_59]) ).
tff(c_68,plain,
knave(husband),
inference(negUnitSimplification,[status(thm)],[c_38,c_62]) ).
tff(c_34,plain,
( knight(wife)
| a_truth(statement_by(husband)) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_41,plain,
a_truth(statement_by(husband)),
inference(splitLeft,[status(thm)],[c_34]) ).
tff(c_28,plain,
says(husband,statement_by(husband)),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_72,plain,
! [Y_23,X_24] :
( ~ a_truth(Y_23)
| ~ says(X_24,Y_23)
| ~ knave(X_24) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_75,plain,
( ~ a_truth(statement_by(husband))
| ~ knave(husband) ),
inference(resolution,[status(thm)],[c_28,c_72]) ).
tff(c_78,plain,
~ knave(husband),
inference(demodulation,[status(thm),theory(equality)],[c_41,c_75]) ).
tff(c_80,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_68,c_78]) ).
tff(c_81,plain,
knight(wife),
inference(splitRight,[status(thm)],[c_34]) ).
tff(c_36,plain,
( a_truth(statement_by(husband))
| ~ knight(wife) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_83,plain,
~ knight(wife),
inference(splitLeft,[status(thm)],[c_36]) ).
tff(c_85,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_81,c_83]) ).
tff(c_86,plain,
a_truth(statement_by(husband)),
inference(splitRight,[status(thm)],[c_36]) ).
tff(c_82,plain,
~ a_truth(statement_by(husband)),
inference(splitRight,[status(thm)],[c_34]) ).
tff(c_90,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_86,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ020-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.11/0.33 % Computer : n018.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Aug 3 17:45:35 EDT 2023
% 0.11/0.33 % CPUTime :
% 3.14/2.06 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/2.06
% 3.42/2.06 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.42/2.10
% 3.42/2.10 Inference rules
% 3.42/2.10 ----------------------
% 3.42/2.10 #Ref : 0
% 3.42/2.10 #Sup : 6
% 3.42/2.10 #Fact : 0
% 3.42/2.10 #Define : 0
% 3.42/2.10 #Split : 3
% 3.42/2.10 #Chain : 0
% 3.42/2.10 #Close : 0
% 3.42/2.10
% 3.42/2.10 Ordering : KBO
% 3.42/2.10
% 3.42/2.10 Simplification rules
% 3.42/2.10 ----------------------
% 3.42/2.10 #Subsume : 3
% 3.42/2.10 #Demod : 6
% 3.42/2.10 #Tautology : 4
% 3.42/2.10 #SimpNegUnit : 2
% 3.42/2.10 #BackRed : 0
% 3.42/2.10
% 3.42/2.10 #Partial instantiations: 0
% 3.42/2.10 #Strategies tried : 1
% 3.42/2.10
% 3.42/2.10 Timing (in seconds)
% 3.42/2.10 ----------------------
% 3.42/2.11 Preprocessing : 0.69
% 3.42/2.11 Parsing : 0.35
% 3.42/2.11 CNF conversion : 0.04
% 3.42/2.11 Main loop : 0.26
% 3.42/2.11 Inferencing : 0.08
% 3.42/2.11 Reduction : 0.07
% 3.42/2.11 Demodulation : 0.05
% 3.42/2.11 BG Simplification : 0.02
% 3.42/2.11 Subsumption : 0.06
% 3.42/2.11 Abstraction : 0.01
% 3.42/2.11 MUC search : 0.00
% 3.42/2.11 Cooper : 0.00
% 3.42/2.11 Total : 1.02
% 3.42/2.11 Index Insertion : 0.00
% 3.42/2.11 Index Deletion : 0.00
% 3.42/2.11 Index Matching : 0.00
% 3.42/2.11 BG Taut test : 0.00
%------------------------------------------------------------------------------