TSTP Solution File: ALG202+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG202+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/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 : n024.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 4.98s 2.27s
% Output : CNFRefutation 5.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 55 ( 17 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 59 ( 23 ~; 19 |; 4 &)
% ( 0 <=>; 13 =>; 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 : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sorti2 > sorti1 > op2 > op1 > #nlpp > j > h > #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_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_48,axiom,
~ ! [U] :
( sorti2(U)
=> ( op2(U,U) = U ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
tff(f_39,axiom,
! [U] :
( sorti2(U)
=> ! [V] :
( sorti2(V)
=> sorti2(op2(U,V)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
tff(f_85,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/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_43,axiom,
! [U] :
( sorti1(U)
=> ( op1(U,U) = U ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
tff(c_8,plain,
op2('#skF_1','#skF_1') != '#skF_1',
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_10,plain,
sorti2('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_4,plain,
! [U_4,V_6] :
( sorti2(op2(U_4,V_6))
| ~ sorti2(V_6)
| ~ sorti2(U_4) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_20,plain,
! [V_9] :
( sorti1(j(V_9))
| ~ sorti2(V_9) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_25,plain,
! [U_20] :
( ( op1(U_20,U_20) = U_20 )
| ~ sorti1(U_20) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_84,plain,
! [V_29] :
( ( op1(j(V_29),j(V_29)) = j(V_29) )
| ~ sorti2(V_29) ),
inference(resolution,[status(thm)],[c_20,c_25]) ).
tff(c_16,plain,
! [Y_13,Z_15] :
( ( op1(j(Y_13),j(Z_15)) = j(op2(Y_13,Z_15)) )
| ~ sorti2(Z_15)
| ~ sorti2(Y_13) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_109,plain,
! [V_30] :
( ( j(op2(V_30,V_30)) = j(V_30) )
| ~ sorti2(V_30)
| ~ sorti2(V_30)
| ~ sorti2(V_30) ),
inference(superposition,[status(thm),theory(equality)],[c_84,c_16]) ).
tff(c_14,plain,
! [X1_16] :
( ( h(j(X1_16)) = X1_16 )
| ~ sorti2(X1_16) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_1725,plain,
! [V_71] :
( ( op2(V_71,V_71) = h(j(V_71)) )
| ~ sorti2(op2(V_71,V_71))
| ~ sorti2(V_71)
| ~ sorti2(V_71)
| ~ sorti2(V_71) ),
inference(superposition,[status(thm),theory(equality)],[c_109,c_14]) ).
tff(c_1735,plain,
! [V_72] :
( ( op2(V_72,V_72) = h(j(V_72)) )
| ~ sorti2(V_72) ),
inference(resolution,[status(thm)],[c_4,c_1725]) ).
tff(c_1857,plain,
! [V_73] :
( ( op2(V_73,V_73) = V_73 )
| ~ sorti2(V_73)
| ~ sorti2(V_73) ),
inference(superposition,[status(thm),theory(equality)],[c_1735,c_14]) ).
tff(c_1865,plain,
( ( op2('#skF_1','#skF_1') = '#skF_1' )
| ~ sorti2('#skF_1') ),
inference(resolution,[status(thm)],[c_10,c_1857]) ).
tff(c_1871,plain,
op2('#skF_1','#skF_1') = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_10,c_1865]) ).
tff(c_1873,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_1871]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : ALG202+1 : TPTP v8.1.2. Released v2.7.0.
% 0.07/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 : n024.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 20:19:45 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.98/2.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.98/2.28
% 4.98/2.28 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.12/2.30
% 5.12/2.30 Inference rules
% 5.12/2.30 ----------------------
% 5.12/2.30 #Ref : 0
% 5.12/2.30 #Sup : 561
% 5.12/2.30 #Fact : 0
% 5.12/2.30 #Define : 0
% 5.12/2.30 #Split : 0
% 5.12/2.30 #Chain : 0
% 5.12/2.30 #Close : 0
% 5.12/2.30
% 5.12/2.30 Ordering : KBO
% 5.12/2.30
% 5.12/2.30 Simplification rules
% 5.12/2.30 ----------------------
% 5.12/2.30 #Subsume : 115
% 5.12/2.30 #Demod : 1
% 5.12/2.30 #Tautology : 94
% 5.12/2.30 #SimpNegUnit : 1
% 5.12/2.30 #BackRed : 0
% 5.12/2.30
% 5.12/2.30 #Partial instantiations: 0
% 5.12/2.30 #Strategies tried : 1
% 5.12/2.30
% 5.12/2.30 Timing (in seconds)
% 5.12/2.30 ----------------------
% 5.12/2.31 Preprocessing : 0.46
% 5.12/2.31 Parsing : 0.26
% 5.12/2.31 CNF conversion : 0.03
% 5.12/2.31 Main loop : 0.70
% 5.12/2.31 Inferencing : 0.28
% 5.12/2.31 Reduction : 0.15
% 5.12/2.31 Demodulation : 0.10
% 5.12/2.31 BG Simplification : 0.04
% 5.12/2.31 Subsumption : 0.18
% 5.12/2.31 Abstraction : 0.03
% 5.12/2.31 MUC search : 0.00
% 5.12/2.31 Cooper : 0.00
% 5.12/2.31 Total : 1.20
% 5.12/2.31 Index Insertion : 0.00
% 5.12/2.31 Index Deletion : 0.00
% 5.12/2.31 Index Matching : 0.00
% 5.12/2.31 BG Taut test : 0.00
%------------------------------------------------------------------------------