TSTP Solution File: SYN553-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN553-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 : n001.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:17 EDT 2023
% Result : Unsatisfiable 6.06s 2.48s
% Output : CNFRefutation 6.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 28 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 49 (; 49 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p2 > f8 > #nlpp > f9 > f6 > f5 > c7 > c4 > c3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c3,type,
c3: $i ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(f5,type,
f5: $i > $i ).
tff(f6,type,
f6: $i > $i ).
tff(f8,type,
f8: ( $i * $i ) > $i ).
tff(f9,type,
f9: $i > $i ).
tff(c7,type,
c7: $i ).
tff(c4,type,
c4: $i ).
tff(f_30,axiom,
! [X11,X12] : p2(f8(X11,X12),f8(X12,X11)),
file(unknown,unknown) ).
tff(f_23,axiom,
! [X0] : p2(X0,X0),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X4,X5,X6,X7] :
( p2(f8(X4,X5),f8(X6,X7))
| ~ p2(X4,X6)
| ~ p2(X5,X7) ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X1,X2,X3] :
( p2(X1,X2)
| ~ p2(X1,X3)
| ~ p2(X3,X2) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X8,X9,X10] : p2(f8(X8,f8(X9,X10)),f8(f8(X8,X9),X10)),
file(unknown,unknown) ).
tff(f_50,axiom,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
file(unknown,unknown) ).
tff(c_10,plain,
! [X11_2,X12_3] : p2(f8(X11_2,X12_3),f8(X12_3,X11_2)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_2,plain,
! [X0_1] : p2(X0_1,X0_1),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_81,plain,
! [X5_34,X7_35,X4_36,X6_37] :
( ~ p2(X5_34,X7_35)
| ~ p2(X4_36,X6_37)
| p2(f8(X4_36,X5_34),f8(X6_37,X7_35)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_21,plain,
! [X3_17,X2_18,X1_19] :
( ~ p2(X3_17,X2_18)
| ~ p2(X1_19,X3_17)
| p2(X1_19,X2_18) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_28,plain,
! [X1_19,X11_2,X12_3] :
( ~ p2(X1_19,f8(X11_2,X12_3))
| p2(X1_19,f8(X12_3,X11_2)) ),
inference(resolution,[status(thm)],[c_10,c_21]) ).
tff(c_88,plain,
! [X4_36,X5_34,X7_35,X6_37] :
( p2(f8(X4_36,X5_34),f8(X7_35,X6_37))
| ~ p2(X5_34,X7_35)
| ~ p2(X4_36,X6_37) ),
inference(resolution,[status(thm)],[c_81,c_28]) ).
tff(c_59,plain,
! [X8_26,X9_27,X10_28] : p2(f8(X8_26,f8(X9_27,X10_28)),f8(f8(X8_26,X9_27),X10_28)),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_12,plain,
! [X3_6,X2_5,X1_4] :
( ~ p2(X3_6,X2_5)
| ~ p2(X1_4,X3_6)
| p2(X1_4,X2_5) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_101,plain,
! [X1_42,X8_43,X9_44,X10_45] :
( ~ p2(X1_42,f8(X8_43,f8(X9_44,X10_45)))
| p2(X1_42,f8(f8(X8_43,X9_44),X10_45)) ),
inference(resolution,[status(thm)],[c_59,c_12]) ).
tff(c_120,plain,
! [X1_46,X10_47,X8_48,X9_49] :
( p2(X1_46,f8(X10_47,f8(X8_48,X9_49)))
| ~ p2(X1_46,f8(X8_48,f8(X9_49,X10_47))) ),
inference(resolution,[status(thm)],[c_101,c_28]) ).
tff(c_3733,plain,
! [X5_301,X9_297,X7_300,X10_298,X4_299] :
( p2(f8(X4_299,X5_301),f8(X10_298,f8(X7_300,X9_297)))
| ~ p2(X5_301,X7_300)
| ~ p2(X4_299,f8(X9_297,X10_298)) ),
inference(resolution,[status(thm)],[c_88,c_120]) ).
tff(c_18,plain,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_3777,plain,
( ~ p2(f9(c3),f9(c3))
| ~ p2(f8(f9(c4),c4),f8(c4,f9(c4))) ),
inference(resolution,[status(thm)],[c_3733,c_18]) ).
tff(c_3804,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_2,c_3777]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN553-1 : TPTP v8.1.2. Released v2.5.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 : n001.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:41:40 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.06/2.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.06/2.48
% 6.06/2.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.06/2.53
% 6.06/2.53 Inference rules
% 6.06/2.53 ----------------------
% 6.06/2.53 #Ref : 0
% 6.06/2.53 #Sup : 1080
% 6.06/2.53 #Fact : 0
% 6.06/2.53 #Define : 0
% 6.06/2.53 #Split : 3
% 6.06/2.53 #Chain : 0
% 6.06/2.53 #Close : 0
% 6.06/2.53
% 6.06/2.53 Ordering : KBO
% 6.06/2.53
% 6.06/2.53 Simplification rules
% 6.06/2.53 ----------------------
% 6.06/2.53 #Subsume : 38
% 6.06/2.53 #Demod : 112
% 6.06/2.53 #Tautology : 111
% 6.06/2.53 #SimpNegUnit : 0
% 6.06/2.53 #BackRed : 0
% 6.06/2.53
% 6.06/2.53 #Partial instantiations: 0
% 6.06/2.53 #Strategies tried : 1
% 6.06/2.53
% 6.06/2.53 Timing (in seconds)
% 6.06/2.53 ----------------------
% 6.06/2.54 Preprocessing : 0.40
% 6.06/2.54 Parsing : 0.22
% 6.06/2.54 CNF conversion : 0.02
% 6.06/2.54 Main loop : 1.06
% 6.06/2.54 Inferencing : 0.35
% 6.06/2.54 Reduction : 0.30
% 6.06/2.54 Demodulation : 0.23
% 6.06/2.54 BG Simplification : 0.03
% 6.06/2.54 Subsumption : 0.30
% 6.06/2.54 Abstraction : 0.04
% 6.06/2.54 MUC search : 0.00
% 6.06/2.54 Cooper : 0.00
% 6.06/2.54 Total : 1.53
% 6.06/2.54 Index Insertion : 0.00
% 6.06/2.54 Index Deletion : 0.00
% 6.06/2.54 Index Matching : 0.00
% 6.06/2.54 BG Taut test : 0.00
%------------------------------------------------------------------------------