TSTP Solution File: PUZ012-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ012-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n014.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:57 EDT 2023
% Result : Unsatisfiable 3.26s 1.79s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of formulae : 45 ( 18 unt; 10 typ; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 55 ( 30 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ label > equal_fruits > equal_boxes > contains > #nlpp > oranges > boxc > boxb > boxa > bananas > apples
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(equal_boxes,type,
equal_boxes: ( $i * $i ) > $o ).
tff(label,type,
label: ( $i * $i ) > $o ).
tff(contains,type,
contains: ( $i * $i ) > $o ).
tff(oranges,type,
oranges: $i ).
tff(equal_fruits,type,
equal_fruits: ( $i * $i ) > $o ).
tff(boxa,type,
boxa: $i ).
tff(boxb,type,
boxb: $i ).
tff(boxc,type,
boxc: $i ).
tff(bananas,type,
bananas: $i ).
tff(apples,type,
apples: $i ).
tff(f_87,axiom,
contains(boxb,apples),
file(unknown,unknown) ).
tff(f_86,axiom,
label(boxc,bananas),
file(unknown,unknown) ).
tff(f_43,axiom,
! [X,Y] :
( ~ label(X,Y)
| ~ contains(X,Y) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] :
( contains(X,apples)
| contains(X,bananas)
| contains(X,oranges) ),
file(unknown,unknown) ).
tff(f_92,axiom,
( ~ contains(boxa,bananas)
| ~ contains(boxc,oranges) ),
file(unknown,unknown) ).
tff(f_49,axiom,
! [X] :
( contains(boxa,X)
| contains(boxb,X)
| contains(boxc,X) ),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X,Y,Z] :
( ~ contains(X,Y)
| ~ contains(X,Z)
| equal_fruits(Y,Z) ),
file(unknown,unknown) ).
tff(f_79,axiom,
~ equal_fruits(apples,bananas),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y,Z] :
( ~ contains(X,Y)
| ~ contains(Z,Y)
| equal_boxes(X,Z) ),
file(unknown,unknown) ).
tff(f_75,axiom,
~ equal_boxes(boxb,boxc),
file(unknown,unknown) ).
tff(c_34,plain,
contains(boxb,apples),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_32,plain,
label(boxc,bananas),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_90,plain,
! [X_24,Y_25] :
( ~ contains(X_24,Y_25)
| ~ label(X_24,Y_25) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_101,plain,
~ contains(boxc,bananas),
inference(resolution,[status(thm)],[c_32,c_90]) ).
tff(c_103,plain,
! [X_26] :
( contains(X_26,oranges)
| contains(X_26,bananas)
| contains(X_26,apples) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_36,plain,
( ~ contains(boxc,oranges)
| ~ contains(boxa,bananas) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_39,plain,
~ contains(boxa,bananas),
inference(splitLeft,[status(thm)],[c_36]) ).
tff(c_67,plain,
! [X_22] :
( contains(boxc,X_22)
| contains(boxb,X_22)
| contains(boxa,X_22) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_40,plain,
! [X_15,Y_16] :
( ~ contains(X_15,Y_16)
| ~ label(X_15,Y_16) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_51,plain,
~ contains(boxc,bananas),
inference(resolution,[status(thm)],[c_32,c_40]) ).
tff(c_72,plain,
( contains(boxb,bananas)
| contains(boxa,bananas) ),
inference(resolution,[status(thm)],[c_67,c_51]) ).
tff(c_76,plain,
contains(boxb,bananas),
inference(negUnitSimplification,[status(thm)],[c_39,c_72]) ).
tff(c_12,plain,
! [Y_8,Z_9,X_7] :
( equal_fruits(Y_8,Z_9)
| ~ contains(X_7,Z_9)
| ~ contains(X_7,Y_8) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_80,plain,
! [Y_23] :
( equal_fruits(Y_23,bananas)
| ~ contains(boxb,Y_23) ),
inference(resolution,[status(thm)],[c_76,c_12]) ).
tff(c_22,plain,
~ equal_fruits(apples,bananas),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_83,plain,
~ contains(boxb,apples),
inference(resolution,[status(thm)],[c_80,c_22]) ).
tff(c_87,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_83]) ).
tff(c_88,plain,
~ contains(boxc,oranges),
inference(splitRight,[status(thm)],[c_36]) ).
tff(c_112,plain,
( contains(boxc,bananas)
| contains(boxc,apples) ),
inference(resolution,[status(thm)],[c_103,c_88]) ).
tff(c_113,plain,
contains(boxc,apples),
inference(negUnitSimplification,[status(thm)],[c_101,c_112]) ).
tff(c_114,plain,
! [X_27,Z_28,Y_29] :
( equal_boxes(X_27,Z_28)
| ~ contains(Z_28,Y_29)
| ~ contains(X_27,Y_29) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_177,plain,
! [X_39] :
( equal_boxes(X_39,boxc)
| ~ contains(X_39,apples) ),
inference(resolution,[status(thm)],[c_113,c_114]) ).
tff(c_18,plain,
~ equal_boxes(boxb,boxc),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_180,plain,
~ contains(boxb,apples),
inference(resolution,[status(thm)],[c_177,c_18]) ).
tff(c_187,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_180]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ012-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:37:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.26/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/1.80
% 3.26/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.26/1.83
% 3.26/1.83 Inference rules
% 3.26/1.83 ----------------------
% 3.26/1.83 #Ref : 0
% 3.26/1.83 #Sup : 33
% 3.26/1.83 #Fact : 0
% 3.26/1.83 #Define : 0
% 3.26/1.83 #Split : 1
% 3.26/1.83 #Chain : 0
% 3.26/1.83 #Close : 0
% 3.26/1.83
% 3.26/1.83 Ordering : KBO
% 3.26/1.83
% 3.26/1.83 Simplification rules
% 3.26/1.83 ----------------------
% 3.26/1.83 #Subsume : 2
% 3.26/1.83 #Demod : 5
% 3.26/1.83 #Tautology : 3
% 3.26/1.83 #SimpNegUnit : 3
% 3.26/1.83 #BackRed : 0
% 3.26/1.83
% 3.26/1.83 #Partial instantiations: 0
% 3.26/1.83 #Strategies tried : 1
% 3.26/1.83
% 3.26/1.83 Timing (in seconds)
% 3.26/1.83 ----------------------
% 3.26/1.83 Preprocessing : 0.43
% 3.26/1.83 Parsing : 0.24
% 3.26/1.83 CNF conversion : 0.02
% 3.26/1.83 Main loop : 0.33
% 3.26/1.83 Inferencing : 0.14
% 3.26/1.83 Reduction : 0.08
% 3.26/1.83 Demodulation : 0.05
% 3.26/1.83 BG Simplification : 0.02
% 3.26/1.83 Subsumption : 0.06
% 3.26/1.83 Abstraction : 0.01
% 3.26/1.84 MUC search : 0.00
% 3.26/1.84 Cooper : 0.00
% 3.26/1.84 Total : 0.82
% 3.26/1.84 Index Insertion : 0.00
% 3.26/1.84 Index Deletion : 0.00
% 3.26/1.84 Index Matching : 0.00
% 3.26/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------