TSTP Solution File: PUZ001-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ001-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 : n010.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:53:48 EDT 2023
% Result : Unsatisfiable 2.62s 1.67s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of formulae : 38 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 27 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ richer > killed > hates > lives > #nlpp > charles > butler > agatha
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(charles,type,
charles: $i ).
tff(agatha,type,
agatha: $i ).
tff(butler,type,
butler: $i ).
tff(lives,type,
lives: $i > $o ).
tff(richer,type,
richer: ( $i * $i ) > $o ).
tff(hates,type,
hates: ( $i * $i ) > $o ).
tff(killed,type,
killed: ( $i * $i ) > $o ).
tff(f_58,axiom,
hates(agatha,agatha),
file(unknown,unknown) ).
tff(f_59,axiom,
hates(agatha,charles),
file(unknown,unknown) ).
tff(f_80,axiom,
( killed(butler,agatha)
| killed(charles,agatha) ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [X,Y] :
( ~ killed(X,Y)
| hates(X,Y) ),
file(unknown,unknown) ).
tff(f_35,axiom,
lives(butler),
file(unknown,unknown) ).
tff(f_76,axiom,
! [X] :
( ~ lives(X)
| richer(X,agatha)
| hates(butler,X) ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [X,Y] :
( ~ killed(X,Y)
| ~ richer(X,Y) ),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X] :
( ~ hates(agatha,X)
| hates(butler,X) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] :
( ~ hates(X,agatha)
| ~ hates(X,butler)
| ~ hates(X,charles) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X] :
( ~ hates(agatha,X)
| ~ hates(charles,X) ),
file(unknown,unknown) ).
tff(c_14,plain,
hates(agatha,agatha),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_16,plain,
hates(agatha,charles),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_24,plain,
( killed(charles,agatha)
| killed(butler,agatha) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_28,plain,
killed(butler,agatha),
inference(splitLeft,[status(thm)],[c_24]) ).
tff(c_18,plain,
! [X_5,Y_6] :
( hates(X_5,Y_6)
| ~ killed(X_5,Y_6) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_33,plain,
hates(butler,agatha),
inference(resolution,[status(thm)],[c_28,c_18]) ).
tff(c_4,plain,
lives(butler),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_34,plain,
! [X_15] :
( hates(butler,X_15)
| richer(X_15,agatha)
| ~ lives(X_15) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_8,plain,
! [X_1,Y_2] :
( ~ richer(X_1,Y_2)
| ~ killed(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_39,plain,
! [X_16] :
( ~ killed(X_16,agatha)
| hates(butler,X_16)
| ~ lives(X_16) ),
inference(resolution,[status(thm)],[c_34,c_8]) ).
tff(c_42,plain,
( hates(butler,butler)
| ~ lives(butler) ),
inference(resolution,[status(thm)],[c_28,c_39]) ).
tff(c_45,plain,
hates(butler,butler),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_42]) ).
tff(c_20,plain,
! [X_7] :
( hates(butler,X_7)
| ~ hates(agatha,X_7) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_46,plain,
! [X_17] :
( ~ hates(X_17,charles)
| ~ hates(X_17,butler)
| ~ hates(X_17,agatha) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_50,plain,
( ~ hates(butler,butler)
| ~ hates(butler,agatha)
| ~ hates(agatha,charles) ),
inference(resolution,[status(thm)],[c_20,c_46]) ).
tff(c_57,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_33,c_45,c_50]) ).
tff(c_58,plain,
killed(charles,agatha),
inference(splitRight,[status(thm)],[c_24]) ).
tff(c_63,plain,
hates(charles,agatha),
inference(resolution,[status(thm)],[c_58,c_18]) ).
tff(c_10,plain,
! [X_3] :
( ~ hates(charles,X_3)
| ~ hates(agatha,X_3) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_66,plain,
~ hates(agatha,agatha),
inference(resolution,[status(thm)],[c_63,c_10]) ).
tff(c_70,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_14,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n010.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 : Thu Aug 3 17:25:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.62/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.62/1.67
% 2.62/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.91/1.70
% 2.91/1.70 Inference rules
% 2.91/1.70 ----------------------
% 2.91/1.70 #Ref : 0
% 2.91/1.70 #Sup : 7
% 2.91/1.70 #Fact : 0
% 2.91/1.70 #Define : 0
% 2.91/1.70 #Split : 1
% 2.91/1.70 #Chain : 0
% 2.91/1.70 #Close : 0
% 2.91/1.70
% 2.91/1.70 Ordering : KBO
% 2.91/1.70
% 2.91/1.70 Simplification rules
% 2.91/1.70 ----------------------
% 2.91/1.70 #Subsume : 0
% 2.91/1.70 #Demod : 5
% 2.91/1.70 #Tautology : 0
% 2.91/1.70 #SimpNegUnit : 0
% 2.91/1.70 #BackRed : 0
% 2.91/1.70
% 2.91/1.70 #Partial instantiations: 0
% 2.91/1.70 #Strategies tried : 1
% 2.91/1.70
% 2.91/1.70 Timing (in seconds)
% 2.91/1.70 ----------------------
% 2.91/1.71 Preprocessing : 0.42
% 2.91/1.71 Parsing : 0.23
% 2.91/1.71 CNF conversion : 0.02
% 2.91/1.71 Main loop : 0.22
% 2.91/1.71 Inferencing : 0.10
% 2.91/1.71 Reduction : 0.05
% 2.91/1.71 Demodulation : 0.03
% 2.91/1.71 BG Simplification : 0.02
% 2.91/1.71 Subsumption : 0.04
% 2.91/1.71 Abstraction : 0.01
% 2.91/1.71 MUC search : 0.00
% 2.91/1.71 Cooper : 0.00
% 2.91/1.71 Total : 0.69
% 2.91/1.71 Index Insertion : 0.00
% 2.91/1.71 Index Deletion : 0.00
% 2.91/1.71 Index Matching : 0.00
% 2.91/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------