TSTP Solution File: SYN554-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN554-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 : n012.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 3.74s 1.99s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 33 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 25 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 37 (; 37 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p4 > p2 > f3 > #nlpp > c7 > c6 > c5
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p4,type,
p4: ( $i * $i ) > $o ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(c6,type,
c6: $i ).
tff(c7,type,
c7: $i ).
tff(f3,type,
f3: ( $i * $i ) > $i ).
tff(c5,type,
c5: $i ).
tff(f_28,axiom,
~ p2(c6,c7),
file(unknown,unknown) ).
tff(f_23,axiom,
! [X2] : p2(X2,X2),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X0,X1] :
( p2(X0,X1)
| p4(X0,X1)
| p4(X1,X0) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X9,X10,X12,X11] :
( p4(X9,X10)
| ~ p2(X12,X10)
| ~ p4(X11,X12)
| ~ p2(X11,X9) ),
file(unknown,unknown) ).
tff(f_29,axiom,
p2(f3(c5,c6),f3(c5,c7)),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X13,X14] :
( p4(f3(c5,X13),f3(c5,X14))
| ~ p4(X13,X14) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X15] : ~ p4(X15,X15),
file(unknown,unknown) ).
tff(c_6,plain,
~ p2(c6,c7),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_2,plain,
! [X2_1] : p2(X2_1,X2_1),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_10,plain,
! [X1_4,X0_3] :
( p4(X1_4,X0_3)
| p4(X0_3,X1_4)
| p2(X0_3,X1_4) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_61,plain,
! [X11_28,X9_29,X12_30,X10_31] :
( ~ p2(X11_28,X9_29)
| ~ p4(X11_28,X12_30)
| ~ p2(X12_30,X10_31)
| p4(X9_29,X10_31) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_78,plain,
! [X2_36,X12_37,X10_38] :
( ~ p4(X2_36,X12_37)
| ~ p2(X12_37,X10_38)
| p4(X2_36,X10_38) ),
inference(resolution,[status(thm)],[c_2,c_61]) ).
tff(c_101,plain,
! [X1_42,X10_43,X0_44] :
( ~ p2(X1_42,X10_43)
| p4(X0_44,X10_43)
| p4(X1_42,X0_44)
| p2(X0_44,X1_42) ),
inference(resolution,[status(thm)],[c_10,c_78]) ).
tff(c_113,plain,
! [X0_44,X2_1] :
( p4(X0_44,X2_1)
| p4(X2_1,X0_44)
| p2(X0_44,X2_1) ),
inference(resolution,[status(thm)],[c_2,c_101]) ).
tff(c_8,plain,
p2(f3(c5,c6),f3(c5,c7)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_14,plain,
! [X13_8,X14_9] :
( ~ p4(X13_8,X14_9)
| p4(f3(c5,X13_8),f3(c5,X14_9)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_256,plain,
! [X14_63,X10_64,X13_65] :
( ~ p2(f3(c5,X14_63),X10_64)
| p4(f3(c5,X13_65),X10_64)
| ~ p4(X13_65,X14_63) ),
inference(resolution,[status(thm)],[c_14,c_78]) ).
tff(c_281,plain,
! [X13_66] :
( p4(f3(c5,X13_66),f3(c5,c7))
| ~ p4(X13_66,c6) ),
inference(resolution,[status(thm)],[c_8,c_256]) ).
tff(c_4,plain,
! [X15_2] : ~ p4(X15_2,X15_2),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_293,plain,
~ p4(c7,c6),
inference(resolution,[status(thm)],[c_281,c_4]) ).
tff(c_299,plain,
( p4(c6,c7)
| p2(c6,c7) ),
inference(resolution,[status(thm)],[c_113,c_293]) ).
tff(c_309,plain,
p4(c6,c7),
inference(negUnitSimplification,[status(thm)],[c_6,c_299]) ).
tff(c_143,plain,
! [X12_47,X10_48] :
( ~ p4(f3(c5,c6),X12_47)
| ~ p2(X12_47,X10_48)
| p4(f3(c5,c7),X10_48) ),
inference(resolution,[status(thm)],[c_8,c_61]) ).
tff(c_372,plain,
! [X14_76,X10_77] :
( ~ p2(f3(c5,X14_76),X10_77)
| p4(f3(c5,c7),X10_77)
| ~ p4(c6,X14_76) ),
inference(resolution,[status(thm)],[c_14,c_143]) ).
tff(c_496,plain,
! [X14_84] :
( p4(f3(c5,c7),f3(c5,X14_84))
| ~ p4(c6,X14_84) ),
inference(resolution,[status(thm)],[c_2,c_372]) ).
tff(c_506,plain,
~ p4(c6,c7),
inference(resolution,[status(thm)],[c_496,c_4]) ).
tff(c_513,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_309,c_506]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN554-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.15 % 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.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:14:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.74/1.99 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.88/2.00
% 3.88/2.00 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.02/2.03
% 4.02/2.03 Inference rules
% 4.02/2.03 ----------------------
% 4.02/2.03 #Ref : 0
% 4.02/2.03 #Sup : 109
% 4.02/2.03 #Fact : 4
% 4.02/2.03 #Define : 0
% 4.02/2.03 #Split : 1
% 4.02/2.03 #Chain : 0
% 4.02/2.03 #Close : 0
% 4.02/2.03
% 4.02/2.03 Ordering : KBO
% 4.02/2.03
% 4.02/2.03 Simplification rules
% 4.02/2.03 ----------------------
% 4.02/2.03 #Subsume : 16
% 4.02/2.03 #Demod : 21
% 4.02/2.03 #Tautology : 15
% 4.02/2.03 #SimpNegUnit : 9
% 4.02/2.03 #BackRed : 0
% 4.02/2.03
% 4.02/2.03 #Partial instantiations: 0
% 4.02/2.03 #Strategies tried : 1
% 4.02/2.03
% 4.02/2.03 Timing (in seconds)
% 4.02/2.03 ----------------------
% 4.02/2.03 Preprocessing : 0.42
% 4.02/2.03 Parsing : 0.23
% 4.02/2.03 CNF conversion : 0.02
% 4.02/2.03 Main loop : 0.45
% 4.02/2.03 Inferencing : 0.18
% 4.02/2.03 Reduction : 0.10
% 4.02/2.03 Demodulation : 0.06
% 4.02/2.03 BG Simplification : 0.02
% 4.02/2.03 Subsumption : 0.12
% 4.02/2.03 Abstraction : 0.02
% 4.02/2.03 MUC search : 0.00
% 4.02/2.03 Cooper : 0.00
% 4.02/2.03 Total : 0.92
% 4.02/2.03 Index Insertion : 0.00
% 4.02/2.03 Index Deletion : 0.00
% 4.02/2.03 Index Matching : 0.00
% 4.02/2.03 BG Taut test : 0.00
%------------------------------------------------------------------------------