TSTP Solution File: ALG041+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG041+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 : n026.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:30:59 EDT 2023
% Result : Theorem 3.34s 1.91s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 71 ( 16 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 83 ( 37 ~; 27 |; 6 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 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 : 34 (; 32 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sorti2 > sorti1 > op2 > op1 > #nlpp > j > h > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(op2,type,
op2: ( $i * $i ) > $i ).
tff(op1,type,
op1: ( $i * $i ) > $i ).
tff(sorti2,type,
sorti2: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(sorti1,type,
sorti1: $i > $o ).
tff(h,type,
h: $i > $i ).
tff(j,type,
j: $i > $i ).
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_47,axiom,
~ ? [U] :
( sorti1(U)
& ! [V] :
( sorti1(V)
=> ( op1(V,V) = U ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
tff(f_32,axiom,
! [U] :
( sorti1(U)
=> ! [V] :
( sorti1(V)
=> sorti1(op1(U,V)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(f_56,axiom,
~ ~ ? [U] :
( sorti2(U)
& ! [V] :
( sorti2(V)
=> ( op2(V,V) = U ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
tff(c_22,plain,
! [V_12] :
( sorti1(j(V_12))
| ~ sorti2(V_12) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_8,plain,
! [U_7] :
( sorti1('#skF_1'(U_7))
| ~ sorti1(U_7) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_2,plain,
! [U_1,V_3] :
( sorti1(op1(U_1,V_3))
| ~ sorti1(V_3)
| ~ sorti1(U_1) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_24,plain,
! [U_11] :
( sorti2(h(U_11))
| ~ sorti1(U_11) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_28,plain,
! [V_24] :
( ( op2(V_24,V_24) = '#skF_2' )
| ~ sorti2(V_24) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_100,plain,
! [U_34] :
( ( op2(h(U_34),h(U_34)) = '#skF_2' )
| ~ sorti1(U_34) ),
inference(resolution,[status(thm)],[c_24,c_28]) ).
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_126,plain,
! [U_35] :
( ( h(op1(U_35,U_35)) = '#skF_2' )
| ~ sorti1(U_35)
| ~ sorti1(U_35)
| ~ sorti1(U_35) ),
inference(superposition,[status(thm),theory(equality)],[c_100,c_20]) ).
tff(c_14,plain,
! [X2_20] :
( ( j(h(X2_20)) = X2_20 )
| ~ sorti1(X2_20) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_321,plain,
! [U_46] :
( ( op1(U_46,U_46) = j('#skF_2') )
| ~ sorti1(op1(U_46,U_46))
| ~ sorti1(U_46)
| ~ sorti1(U_46)
| ~ sorti1(U_46) ),
inference(superposition,[status(thm),theory(equality)],[c_126,c_14]) ).
tff(c_331,plain,
! [V_47] :
( ( op1(V_47,V_47) = j('#skF_2') )
| ~ sorti1(V_47) ),
inference(resolution,[status(thm)],[c_2,c_321]) ).
tff(c_344,plain,
! [U_48] :
( ( op1('#skF_1'(U_48),'#skF_1'(U_48)) = j('#skF_2') )
| ~ sorti1(U_48) ),
inference(resolution,[status(thm)],[c_8,c_331]) ).
tff(c_6,plain,
! [U_7] :
( ( op1('#skF_1'(U_7),'#skF_1'(U_7)) != U_7 )
| ~ sorti1(U_7) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_365,plain,
~ sorti1(j('#skF_2')),
inference(superposition,[status(thm),theory(equality)],[c_344,c_6]) ).
tff(c_423,plain,
! [V_52] :
( ( op1(j(V_52),j(V_52)) = j('#skF_2') )
| ~ sorti2(V_52) ),
inference(resolution,[status(thm)],[c_22,c_331]) ).
tff(c_441,plain,
! [V_52] :
( sorti1(j('#skF_2'))
| ~ sorti1(j(V_52))
| ~ sorti1(j(V_52))
| ~ sorti2(V_52) ),
inference(superposition,[status(thm),theory(equality)],[c_423,c_2]) ).
tff(c_458,plain,
! [V_53] :
( ~ sorti1(j(V_53))
| ~ sorti1(j(V_53))
| ~ sorti2(V_53) ),
inference(negUnitSimplification,[status(thm)],[c_365,c_441]) ).
tff(c_467,plain,
! [V_54] :
( ~ sorti1(j(V_54))
| ~ sorti2(V_54) ),
inference(resolution,[status(thm)],[c_22,c_458]) ).
tff(c_474,plain,
! [V_12] : ~ sorti2(V_12),
inference(resolution,[status(thm)],[c_22,c_467]) ).
tff(c_12,plain,
sorti2('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_479,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_474,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG041+1 : TPTP v8.1.2. Released v2.7.0.
% 0.13/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.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 20:41:32 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.34/1.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.34/1.91
% 3.34/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.34/1.94
% 3.34/1.94 Inference rules
% 3.34/1.94 ----------------------
% 3.34/1.94 #Ref : 0
% 3.34/1.94 #Sup : 124
% 3.34/1.94 #Fact : 0
% 3.34/1.94 #Define : 0
% 3.34/1.94 #Split : 0
% 3.34/1.94 #Chain : 0
% 3.34/1.94 #Close : 0
% 3.34/1.94
% 3.34/1.94 Ordering : KBO
% 3.34/1.94
% 3.34/1.94 Simplification rules
% 3.34/1.94 ----------------------
% 3.34/1.94 #Subsume : 24
% 3.34/1.94 #Demod : 19
% 3.34/1.94 #Tautology : 40
% 3.34/1.94 #SimpNegUnit : 5
% 3.34/1.94 #BackRed : 2
% 3.34/1.94
% 3.34/1.94 #Partial instantiations: 0
% 3.34/1.94 #Strategies tried : 1
% 3.34/1.94
% 3.34/1.94 Timing (in seconds)
% 3.34/1.94 ----------------------
% 3.34/1.94 Preprocessing : 0.46
% 3.34/1.94 Parsing : 0.25
% 3.34/1.95 CNF conversion : 0.03
% 3.34/1.95 Main loop : 0.40
% 3.34/1.95 Inferencing : 0.18
% 3.34/1.95 Reduction : 0.09
% 3.34/1.95 Demodulation : 0.06
% 3.34/1.95 BG Simplification : 0.02
% 3.34/1.95 Subsumption : 0.09
% 3.34/1.95 Abstraction : 0.02
% 3.34/1.95 MUC search : 0.00
% 3.34/1.95 Cooper : 0.00
% 3.34/1.95 Total : 0.91
% 3.34/1.95 Index Insertion : 0.00
% 3.34/1.95 Index Deletion : 0.00
% 3.34/1.95 Index Matching : 0.00
% 3.34/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------