TSTP Solution File: ALG203+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG203+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 : n018.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:20 EDT 2023
% Result : Theorem 5.13s 2.33s
% Output : CNFRefutation 5.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 36 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 76 ( 24 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 86 ( 38 ~; 27 |; 10 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 6 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 30 (; 26 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sorti2 > sorti1 > op2 > op1 > #nlpp > j > h > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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('#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_49,axiom,
( ? [U] :
( sorti1(U)
& ( op1(U,U) = U ) )
& ? [V] :
( sorti1(V)
& ( op1(V,V) != V ) ) ),
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_97,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_60,axiom,
~ ( ? [U] :
( sorti2(U)
& ( op2(U,U) = U ) )
& ? [V] :
( sorti2(V)
& ( op2(V,V) != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
tff(c_6,plain,
op1('#skF_1','#skF_1') != '#skF_1',
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_8,plain,
sorti1('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_49]) ).
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_22,plain,
! [W_11,X_13] :
( ( op2(h(W_11),h(X_13)) = h(op1(W_11,X_13)) )
| ~ sorti1(X_13)
| ~ sorti1(W_11) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_26,plain,
! [U_9] :
( sorti2(h(U_9))
| ~ sorti1(U_9) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_12,plain,
sorti1('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_10,plain,
op1('#skF_2','#skF_2') = '#skF_2',
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_14,plain,
! [V_8,U_7] :
( ( op2(V_8,V_8) = V_8 )
| ~ sorti2(V_8)
| ( op2(U_7,U_7) != U_7 )
| ~ sorti2(U_7) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_91,plain,
! [U_29] :
( ( op2(U_29,U_29) != U_29 )
| ~ sorti2(U_29) ),
inference(splitLeft,[status(thm)],[c_14]) ).
tff(c_113,plain,
! [X_32] :
( ( h(op1(X_32,X_32)) != h(X_32) )
| ~ sorti2(h(X_32))
| ~ sorti1(X_32)
| ~ sorti1(X_32) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_91]) ).
tff(c_118,plain,
( ~ sorti2(h('#skF_2'))
| ~ sorti1('#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_113]) ).
tff(c_121,plain,
~ sorti2(h('#skF_2')),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_118]) ).
tff(c_133,plain,
~ sorti1('#skF_2'),
inference(resolution,[status(thm)],[c_26,c_121]) ).
tff(c_137,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_133]) ).
tff(c_139,plain,
! [V_35] :
( ( op2(V_35,V_35) = V_35 )
| ~ sorti2(V_35) ),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_146,plain,
! [U_36] :
( ( op2(h(U_36),h(U_36)) = h(U_36) )
| ~ sorti1(U_36) ),
inference(resolution,[status(thm)],[c_26,c_139]) ).
tff(c_189,plain,
! [X_39] :
( ( h(op1(X_39,X_39)) = h(X_39) )
| ~ sorti1(X_39)
| ~ sorti1(X_39)
| ~ sorti1(X_39) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_146]) ).
tff(c_16,plain,
! [X2_18] :
( ( j(h(X2_18)) = X2_18 )
| ~ sorti1(X2_18) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_1811,plain,
! [X_77] :
( ( op1(X_77,X_77) = j(h(X_77)) )
| ~ sorti1(op1(X_77,X_77))
| ~ sorti1(X_77)
| ~ sorti1(X_77)
| ~ sorti1(X_77) ),
inference(superposition,[status(thm),theory(equality)],[c_189,c_16]) ).
tff(c_1930,plain,
! [V_78] :
( ( op1(V_78,V_78) = j(h(V_78)) )
| ~ sorti1(V_78) ),
inference(resolution,[status(thm)],[c_2,c_1811]) ).
tff(c_2057,plain,
! [V_79] :
( ( op1(V_79,V_79) = V_79 )
| ~ sorti1(V_79)
| ~ sorti1(V_79) ),
inference(superposition,[status(thm),theory(equality)],[c_1930,c_16]) ).
tff(c_2065,plain,
( ( op1('#skF_1','#skF_1') = '#skF_1' )
| ~ sorti1('#skF_1') ),
inference(resolution,[status(thm)],[c_8,c_2057]) ).
tff(c_2073,plain,
op1('#skF_1','#skF_1') = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_8,c_2065]) ).
tff(c_2075,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_2073]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ALG203+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 20:36:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 5.13/2.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.13/2.33
% 5.13/2.33 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.13/2.36
% 5.13/2.36 Inference rules
% 5.13/2.36 ----------------------
% 5.13/2.36 #Ref : 0
% 5.13/2.36 #Sup : 603
% 5.13/2.36 #Fact : 0
% 5.13/2.36 #Define : 0
% 5.13/2.36 #Split : 1
% 5.13/2.36 #Chain : 0
% 5.13/2.36 #Close : 0
% 5.13/2.36
% 5.13/2.36 Ordering : KBO
% 5.13/2.36
% 5.13/2.36 Simplification rules
% 5.13/2.36 ----------------------
% 5.13/2.36 #Subsume : 122
% 5.13/2.36 #Demod : 60
% 5.13/2.36 #Tautology : 120
% 5.13/2.36 #SimpNegUnit : 1
% 5.13/2.36 #BackRed : 0
% 5.13/2.36
% 5.13/2.36 #Partial instantiations: 0
% 5.13/2.36 #Strategies tried : 1
% 5.13/2.36
% 5.13/2.36 Timing (in seconds)
% 5.13/2.36 ----------------------
% 5.13/2.36 Preprocessing : 0.46
% 5.13/2.36 Parsing : 0.26
% 5.13/2.36 CNF conversion : 0.03
% 5.13/2.36 Main loop : 0.71
% 5.13/2.36 Inferencing : 0.29
% 5.13/2.36 Reduction : 0.15
% 5.13/2.36 Demodulation : 0.10
% 5.13/2.36 BG Simplification : 0.04
% 5.13/2.36 Subsumption : 0.17
% 5.13/2.36 Abstraction : 0.03
% 5.13/2.36 MUC search : 0.00
% 5.13/2.36 Cooper : 0.00
% 5.13/2.36 Total : 1.21
% 5.13/2.36 Index Insertion : 0.00
% 5.13/2.37 Index Deletion : 0.00
% 5.13/2.37 Index Matching : 0.00
% 5.13/2.37 BG Taut test : 0.00
%------------------------------------------------------------------------------