TSTP Solution File: PUZ047-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ047-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n032.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:07 EDT 2023
% Result : Unsatisfiable 2.10s 1.54s
% Output : CNFRefutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 33 ( 12 unt; 8 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 35 ( 22 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 5 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 32 (; 32 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp > take_wolf > take_goat > take_cabbage > go_alone > start > south > north
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(take_cabbage,type,
take_cabbage: $i > $i ).
tff(go_alone,type,
go_alone: $i > $i ).
tff(take_goat,type,
take_goat: $i > $i ).
tff(start,type,
start: $i ).
tff(north,type,
north: $i ).
tff(take_wolf,type,
take_wolf: $i > $i ).
tff(south,type,
south: $i ).
tff(p,type,
p: ( $i * $i * $i * $i * $i ) > $o ).
tff(f_67,axiom,
! [A,B,C] :
( p(north,A,north,B,take_goat(C))
| ~ p(south,A,south,B,C) ),
file(unknown,unknown) ).
tff(f_72,axiom,
! [A,B,C] :
( p(south,A,south,B,take_goat(C))
| ~ p(north,A,north,B,C) ),
file(unknown,unknown) ).
tff(f_95,axiom,
! [A] : ~ p(north,north,north,north,A),
file(unknown,unknown) ).
tff(f_32,axiom,
! [A] :
( p(south,north,south,north,go_alone(A))
| ~ p(north,north,south,north,A) ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [A] :
( p(north,north,south,north,take_wolf(A))
| ~ p(south,south,south,north,A) ),
file(unknown,unknown) ).
tff(f_87,axiom,
! [A] :
( p(north,south,north,north,take_cabbage(A))
| ~ p(south,south,north,south,A) ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [A] :
( p(south,south,north,south,go_alone(A))
| ~ p(north,south,north,south,A) ),
file(unknown,unknown) ).
tff(f_22,axiom,
p(south,south,south,south,start),
file(unknown,unknown) ).
tff(c_20,plain,
! [A_9,B_10,C_11] :
( ~ p(south,A_9,south,B_10,C_11)
| p(north,A_9,north,B_10,take_goat(C_11)) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_55,plain,
! [A_37,B_38,C_39] :
( ~ p(north,A_37,north,B_38,C_39)
| p(south,A_37,south,B_38,take_goat(C_39)) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_44,plain,
! [A_31,B_32,C_33] :
( ~ p(south,A_31,south,B_32,C_33)
| p(north,A_31,north,B_32,take_goat(C_33)) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_32,plain,
! [A_19] : ~ p(north,north,north,north,A_19),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_49,plain,
! [C_33] : ~ p(south,north,south,north,C_33),
inference(resolution,[status(thm)],[c_44,c_32]) ).
tff(c_6,plain,
! [A_2] :
( ~ p(north,north,south,north,A_2)
| p(south,north,south,north,go_alone(A_2)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_50,plain,
! [A_2] : ~ p(north,north,south,north,A_2),
inference(negUnitSimplification,[status(thm)],[c_49,c_6]) ).
tff(c_12,plain,
! [A_5] :
( ~ p(south,south,south,north,A_5)
| p(north,north,south,north,take_wolf(A_5)) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_52,plain,
! [A_5] : ~ p(south,south,south,north,A_5),
inference(negUnitSimplification,[status(thm)],[c_50,c_12]) ).
tff(c_64,plain,
! [C_39] : ~ p(north,south,north,north,C_39),
inference(resolution,[status(thm)],[c_55,c_52]) ).
tff(c_28,plain,
! [A_17] :
( ~ p(south,south,north,south,A_17)
| p(north,south,north,north,take_cabbage(A_17)) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_66,plain,
! [A_17] : ~ p(south,south,north,south,A_17),
inference(negUnitSimplification,[status(thm)],[c_64,c_28]) ).
tff(c_10,plain,
! [A_4] :
( ~ p(north,south,north,south,A_4)
| p(south,south,north,south,go_alone(A_4)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_83,plain,
! [A_43] : ~ p(north,south,north,south,A_43),
inference(negUnitSimplification,[status(thm)],[c_66,c_10]) ).
tff(c_88,plain,
! [C_11] : ~ p(south,south,south,south,C_11),
inference(resolution,[status(thm)],[c_20,c_83]) ).
tff(c_2,plain,
p(south,south,south,south,start),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_96,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_88,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : PUZ047-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.09 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu Aug 3 17:37:51 EDT 2023
% 0.10/0.30 % CPUTime :
% 2.10/1.54 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.10/1.55
% 2.10/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.10/1.59
% 2.10/1.59 Inference rules
% 2.10/1.59 ----------------------
% 2.10/1.59 #Ref : 0
% 2.10/1.59 #Sup : 7
% 2.10/1.59 #Fact : 0
% 2.10/1.59 #Define : 0
% 2.10/1.59 #Split : 0
% 2.10/1.59 #Chain : 0
% 2.10/1.59 #Close : 0
% 2.10/1.59
% 2.10/1.59 Ordering : KBO
% 2.10/1.59
% 2.10/1.59 Simplification rules
% 2.10/1.59 ----------------------
% 2.10/1.59 #Subsume : 9
% 2.10/1.59 #Demod : 0
% 2.10/1.59 #Tautology : 0
% 2.10/1.59 #SimpNegUnit : 7
% 2.10/1.59 #BackRed : 6
% 2.10/1.59
% 2.10/1.59 #Partial instantiations: 0
% 2.10/1.59 #Strategies tried : 1
% 2.10/1.59
% 2.10/1.59 Timing (in seconds)
% 2.10/1.59 ----------------------
% 2.10/1.59 Preprocessing : 0.44
% 2.10/1.59 Parsing : 0.25
% 2.10/1.59 CNF conversion : 0.02
% 2.10/1.59 Main loop : 0.23
% 2.10/1.59 Inferencing : 0.10
% 2.10/1.59 Reduction : 0.05
% 2.10/1.59 Demodulation : 0.03
% 2.10/1.59 BG Simplification : 0.02
% 2.10/1.59 Subsumption : 0.06
% 2.10/1.59 Abstraction : 0.01
% 2.10/1.59 MUC search : 0.00
% 2.10/1.59 Cooper : 0.00
% 2.10/1.59 Total : 0.74
% 2.10/1.59 Index Insertion : 0.00
% 2.10/1.59 Index Deletion : 0.00
% 2.10/1.59 Index Matching : 0.00
% 2.10/1.59 BG Taut test : 0.00
%------------------------------------------------------------------------------