TSTP Solution File: ALG177+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG177+1 : TPTP v8.1.2. Released v2.7.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 : n025.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:32:17 EDT 2023
% Result : Theorem 4.61s 2.20s
% Output : CNFRefutation 5.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 77 ( 17 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 99 ( 48 ~; 34 |; 6 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 7 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 30 (; 28 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sorti2 > sorti1 > op2 > op1 > #nlpp > j > h > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(op2,type,
op2: ( $i * $i ) > $i ).
tff(op1,type,
op1: ( $i * $i ) > $i ).
tff(sorti2,type,
sorti2: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(sorti1,type,
sorti1: $i > $o ).
tff(h,type,
h: $i > $i ).
tff(j,type,
j: $i > $i ).
tff(f_47,axiom,
? [U] :
( sorti1(U)
& ! [V] :
( sorti1(V)
=> ( op1(U,V) != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
tff(f_93,negated_conjecture,
~ ( ( ! [U] :
( sorti1(U)
=> sorti2(h(U)) )
& ! [V] :
( sorti2(V)
=> sorti1(j(V)) ) )
=> ~ ( ! [W] :
( sorti1(W)
=> ! [X] :
( sorti1(X)
=> ( h(op1(W,X)) = op2(h(W),h(X)) ) ) )
& ! [Y] :
( sorti2(Y)
=> ! [Z] :
( sorti2(Z)
=> ( j(op2(Y,Z)) = op1(j(Y),j(Z)) ) ) )
& ! [X1] :
( sorti2(X1)
=> ( h(j(X1)) = X1 ) )
& ! [X2] :
( sorti1(X2)
=> ( j(h(X2)) = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_56,axiom,
~ ? [U] :
( sorti2(U)
& ! [V] :
( sorti2(V)
=> ( op2(U,V) != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
tff(c_8,plain,
sorti1('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_24,plain,
! [U_11] :
( sorti2(h(U_11))
| ~ sorti1(U_11) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_20,plain,
! [W_13,X_15] :
( ( op2(h(W_13),h(X_15)) = h(op1(W_13,X_15)) )
| ~ sorti1(X_15)
| ~ sorti1(W_13) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_14,plain,
! [X2_20] :
( ( j(h(X2_20)) = X2_20 )
| ~ sorti1(X2_20) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_124,plain,
! [Y_37,Z_38] :
( ( op1(j(Y_37),j(Z_38)) = j(op2(Y_37,Z_38)) )
| ~ sorti2(Z_38)
| ~ sorti2(Y_37) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_194,plain,
! [X2_47,Z_48] :
( ( j(op2(h(X2_47),Z_48)) = op1(X2_47,j(Z_48)) )
| ~ sorti2(Z_48)
| ~ sorti2(h(X2_47))
| ~ sorti1(X2_47) ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_124]) ).
tff(c_1338,plain,
! [W_113,X_114] :
( ( op1(W_113,j(h(X_114))) = j(h(op1(W_113,X_114))) )
| ~ sorti2(h(X_114))
| ~ sorti2(h(W_113))
| ~ sorti1(W_113)
| ~ sorti1(X_114)
| ~ sorti1(W_113) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_194]) ).
tff(c_22,plain,
! [V_12] :
( sorti1(j(V_12))
| ~ sorti2(V_12) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_40,plain,
! [V_25] :
( ( op1('#skF_1',V_25) != V_25 )
| ~ sorti1(V_25) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_47,plain,
! [V_12] :
( ( op1('#skF_1',j(V_12)) != j(V_12) )
| ~ sorti2(V_12) ),
inference(resolution,[status(thm)],[c_22,c_40]) ).
tff(c_1400,plain,
! [X_114] :
( ( j(h(op1('#skF_1',X_114))) != j(h(X_114)) )
| ~ sorti2(h(X_114))
| ~ sorti2(h(X_114))
| ~ sorti2(h('#skF_1'))
| ~ sorti1('#skF_1')
| ~ sorti1(X_114)
| ~ sorti1('#skF_1') ),
inference(superposition,[status(thm),theory(equality)],[c_1338,c_47]) ).
tff(c_1431,plain,
! [X_114] :
( ( j(h(op1('#skF_1',X_114))) != j(h(X_114)) )
| ~ sorti2(h(X_114))
| ~ sorti2(h('#skF_1'))
| ~ sorti1(X_114) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_1400]) ).
tff(c_1433,plain,
~ sorti2(h('#skF_1')),
inference(splitLeft,[status(thm)],[c_1431]) ).
tff(c_1436,plain,
~ sorti1('#skF_1'),
inference(resolution,[status(thm)],[c_24,c_1433]) ).
tff(c_1440,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_1436]) ).
tff(c_1442,plain,
sorti2(h('#skF_1')),
inference(splitRight,[status(thm)],[c_1431]) ).
tff(c_12,plain,
! [U_9] :
( sorti2('#skF_2'(U_9))
| ~ sorti2(U_9) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_10,plain,
! [U_9] :
( ( op2(U_9,'#skF_2'(U_9)) = '#skF_2'(U_9) )
| ~ sorti2(U_9) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_1465,plain,
! [X2_116] :
( ( op1(X2_116,j('#skF_2'(h(X2_116)))) = j('#skF_2'(h(X2_116))) )
| ~ sorti2('#skF_2'(h(X2_116)))
| ~ sorti2(h(X2_116))
| ~ sorti1(X2_116)
| ~ sorti2(h(X2_116)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_194]) ).
tff(c_1528,plain,
( ~ sorti2('#skF_2'(h('#skF_1')))
| ~ sorti1('#skF_1')
| ~ sorti2(h('#skF_1')) ),
inference(superposition,[status(thm),theory(equality)],[c_1465,c_47]) ).
tff(c_1560,plain,
~ sorti2('#skF_2'(h('#skF_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_1442,c_8,c_1528]) ).
tff(c_1564,plain,
~ sorti2(h('#skF_1')),
inference(resolution,[status(thm)],[c_12,c_1560]) ).
tff(c_1568,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1442,c_1564]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ALG177+1 : TPTP v8.1.2. Released v2.7.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.14/0.35 % Computer : n025.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 20:39:35 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.61/2.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.10/2.20
% 5.10/2.20 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.10/2.23
% 5.10/2.23 Inference rules
% 5.10/2.23 ----------------------
% 5.10/2.23 #Ref : 0
% 5.10/2.23 #Sup : 442
% 5.10/2.23 #Fact : 0
% 5.10/2.23 #Define : 0
% 5.10/2.23 #Split : 1
% 5.10/2.23 #Chain : 0
% 5.10/2.23 #Close : 0
% 5.10/2.23
% 5.10/2.23 Ordering : KBO
% 5.10/2.23
% 5.10/2.23 Simplification rules
% 5.10/2.23 ----------------------
% 5.10/2.23 #Subsume : 89
% 5.10/2.23 #Demod : 14
% 5.10/2.23 #Tautology : 46
% 5.10/2.23 #SimpNegUnit : 0
% 5.10/2.23 #BackRed : 0
% 5.10/2.23
% 5.10/2.23 #Partial instantiations: 0
% 5.10/2.23 #Strategies tried : 1
% 5.10/2.23
% 5.10/2.23 Timing (in seconds)
% 5.10/2.23 ----------------------
% 5.10/2.23 Preprocessing : 0.47
% 5.10/2.23 Parsing : 0.26
% 5.10/2.23 CNF conversion : 0.03
% 5.10/2.23 Main loop : 0.70
% 5.10/2.23 Inferencing : 0.29
% 5.10/2.23 Reduction : 0.15
% 5.10/2.23 Demodulation : 0.10
% 5.10/2.23 BG Simplification : 0.04
% 5.10/2.23 Subsumption : 0.18
% 5.10/2.23 Abstraction : 0.03
% 5.10/2.23 MUC search : 0.00
% 5.10/2.23 Cooper : 0.00
% 5.10/2.23 Total : 1.22
% 5.10/2.23 Index Insertion : 0.00
% 5.10/2.23 Index Deletion : 0.00
% 5.10/2.24 Index Matching : 0.00
% 5.10/2.24 BG Taut test : 0.00
%------------------------------------------------------------------------------