TSTP Solution File: SYN561-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN561-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/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 : n008.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 11:11:18 EDT 2023
% Result : Unsatisfiable 6.82s 2.77s
% Output : CNFRefutation 6.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 23
% Syntax : Number of formulae : 45 ( 16 unt; 15 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 30 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p9 > p8 > p2 > f7 > f6 > f3 > #nlpp > f5 > f4 > c16 > c15 > c14 > c13 > c12 > c11 > c10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c12,type,
c12: $i ).
tff(c16,type,
c16: $i ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(c14,type,
c14: $i ).
tff(p8,type,
p8: ( $i * $i ) > $o ).
tff(f7,type,
f7: ( $i * $i ) > $i ).
tff(c10,type,
c10: $i ).
tff(c15,type,
c15: $i ).
tff(f5,type,
f5: $i > $i ).
tff(c11,type,
c11: $i ).
tff(f4,type,
f4: $i > $i ).
tff(c13,type,
c13: $i ).
tff(f3,type,
f3: ( $i * $i ) > $i ).
tff(p9,type,
p9: ( $i * $i ) > $o ).
tff(f6,type,
f6: ( $i * $i ) > $i ).
tff(f_23,axiom,
! [X0] : p2(X0,X0),
file(unknown,unknown) ).
tff(f_24,axiom,
p9(c14,c10),
file(unknown,unknown) ).
tff(f_25,axiom,
p8(c11,c14),
file(unknown,unknown) ).
tff(f_26,axiom,
p2(f7(c10,c14),c15),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X1,X2,X0] :
( p2(X1,X2)
| ~ p2(X0,X1)
| ~ p2(X0,X2) ),
file(unknown,unknown) ).
tff(f_28,axiom,
p2(f3(f4(f5(c12)),c13),c16),
file(unknown,unknown) ).
tff(f_27,axiom,
p2(f6(c15,c11),c16),
file(unknown,unknown) ).
tff(f_104,axiom,
! [X28,X27] :
( ~ p9(X28,c10)
| ~ p8(c11,X28)
| ~ p2(f7(c10,X28),X27)
| ~ p2(f6(X27,c11),f3(f4(f5(c12)),c13)) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [X0_1] : p2(X0_1,X0_1),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_4,plain,
p9(c14,c10),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_6,plain,
p8(c11,c14),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_8,plain,
p2(f7(c10,c14),c15),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_34,plain,
! [X0_36,X2_37,X1_38] :
( ~ p2(X0_36,X2_37)
| ~ p2(X0_36,X1_38)
| p2(X1_38,X2_37) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_72,plain,
! [X0_43,X1_44] :
( ~ p2(X0_43,X1_44)
| p2(X1_44,X0_43) ),
inference(resolution,[status(thm)],[c_2,c_34]) ).
tff(c_89,plain,
p2(c15,f7(c10,c14)),
inference(resolution,[status(thm)],[c_8,c_72]) ).
tff(c_18,plain,
! [X0_8,X2_7,X1_6] :
( ~ p2(X0_8,X2_7)
| ~ p2(X0_8,X1_6)
| p2(X1_6,X2_7) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_238,plain,
! [X1_60] :
( ~ p2(c15,X1_60)
| p2(X1_60,f7(c10,c14)) ),
inference(resolution,[status(thm)],[c_89,c_18]) ).
tff(c_52,plain,
! [X0_1,X1_38] :
( ~ p2(X0_1,X1_38)
| p2(X1_38,X0_1) ),
inference(resolution,[status(thm)],[c_2,c_34]) ).
tff(c_260,plain,
! [X1_60] :
( p2(f7(c10,c14),X1_60)
| ~ p2(c15,X1_60) ),
inference(resolution,[status(thm)],[c_238,c_52]) ).
tff(c_12,plain,
p2(f3(f4(f5(c12)),c13),c16),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_87,plain,
p2(c16,f3(f4(f5(c12)),c13)),
inference(resolution,[status(thm)],[c_12,c_72]) ).
tff(c_10,plain,
p2(f6(c15,c11),c16),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_88,plain,
p2(c16,f6(c15,c11)),
inference(resolution,[status(thm)],[c_10,c_72]) ).
tff(c_213,plain,
! [X1_59] :
( ~ p2(c16,X1_59)
| p2(X1_59,f6(c15,c11)) ),
inference(resolution,[status(thm)],[c_88,c_18]) ).
tff(c_235,plain,
! [X1_59] :
( p2(f6(c15,c11),X1_59)
| ~ p2(c16,X1_59) ),
inference(resolution,[status(thm)],[c_213,c_52]) ).
tff(c_406,plain,
! [X27_81,X28_82] :
( ~ p2(f6(X27_81,c11),f3(f4(f5(c12)),c13))
| ~ p2(f7(c10,X28_82),X27_81)
| ~ p8(c11,X28_82)
| ~ p9(X28_82,c10) ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_409,plain,
! [X28_82] :
( ~ p2(f7(c10,X28_82),c15)
| ~ p8(c11,X28_82)
| ~ p9(X28_82,c10)
| ~ p2(c16,f3(f4(f5(c12)),c13)) ),
inference(resolution,[status(thm)],[c_235,c_406]) ).
tff(c_3686,plain,
! [X28_236] :
( ~ p2(f7(c10,X28_236),c15)
| ~ p8(c11,X28_236)
| ~ p9(X28_236,c10) ),
inference(demodulation,[status(thm),theory(equality)],[c_87,c_409]) ).
tff(c_3694,plain,
( ~ p8(c11,c14)
| ~ p9(c14,c10)
| ~ p2(c15,c15) ),
inference(resolution,[status(thm)],[c_260,c_3686]) ).
tff(c_3704,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4,c_6,c_3694]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN561-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13 % 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 : n008.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:10:34 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.82/2.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.82/2.78
% 6.82/2.78 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.82/2.81
% 6.82/2.81 Inference rules
% 6.82/2.81 ----------------------
% 6.82/2.81 #Ref : 0
% 6.82/2.81 #Sup : 1111
% 6.82/2.81 #Fact : 0
% 6.82/2.81 #Define : 0
% 6.82/2.81 #Split : 16
% 6.82/2.81 #Chain : 0
% 6.82/2.81 #Close : 0
% 6.82/2.81
% 6.82/2.81 Ordering : KBO
% 6.82/2.81
% 6.82/2.81 Simplification rules
% 6.82/2.81 ----------------------
% 6.82/2.81 #Subsume : 114
% 6.82/2.81 #Demod : 67
% 6.82/2.81 #Tautology : 33
% 6.82/2.81 #SimpNegUnit : 5
% 6.82/2.81 #BackRed : 0
% 6.82/2.81
% 6.82/2.81 #Partial instantiations: 0
% 6.82/2.81 #Strategies tried : 1
% 6.82/2.81
% 6.82/2.81 Timing (in seconds)
% 6.82/2.81 ----------------------
% 6.82/2.81 Preprocessing : 0.48
% 6.82/2.81 Parsing : 0.27
% 6.82/2.81 CNF conversion : 0.03
% 6.82/2.81 Main loop : 1.23
% 6.82/2.81 Inferencing : 0.37
% 6.82/2.81 Reduction : 0.30
% 6.82/2.81 Demodulation : 0.20
% 6.82/2.81 BG Simplification : 0.04
% 6.82/2.81 Subsumption : 0.42
% 6.82/2.81 Abstraction : 0.04
% 6.82/2.81 MUC search : 0.00
% 6.82/2.81 Cooper : 0.00
% 6.82/2.81 Total : 1.76
% 6.82/2.81 Index Insertion : 0.00
% 6.82/2.81 Index Deletion : 0.00
% 6.82/2.81 Index Matching : 0.00
% 6.82/2.81 BG Taut test : 0.00
%------------------------------------------------------------------------------