TSTP Solution File: ALG069+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG069+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 : n029.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:31:04 EDT 2023
% Result : Theorem 3.13s 1.84s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 54 ( 15 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 65 ( 29 ~; 19 |; 6 &)
% ( 0 <=>; 11 =>; 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 : 25 (; 23 !; 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_91,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_46,axiom,
! [U] :
( sorti1(U)
=> ? [V] :
( sorti1(V)
& ( op1(V,V) = U ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
tff(f_54,axiom,
~ ! [U] :
( sorti2(U)
=> ? [V] :
( sorti2(V)
& ( op2(V,V) = U ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
tff(c_16,plain,
! [X1_19] :
( ( h(j(X1_19)) = X1_19 )
| ~ sorti2(X1_19) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_22,plain,
! [V_12] :
( sorti1(j(V_12))
| ~ sorti2(V_12) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_8,plain,
! [U_7] :
( sorti1('#skF_1'(U_7))
| ~ sorti1(U_7) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_24,plain,
! [U_11] :
( sorti2(h(U_11))
| ~ sorti1(U_11) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
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_46]) ).
tff(c_93,plain,
! [W_34,X_35] :
( ( op2(h(W_34),h(X_35)) = h(op1(W_34,X_35)) )
| ~ sorti1(X_35)
| ~ sorti1(W_34) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_10,plain,
! [V_10] :
( ( op2(V_10,V_10) != '#skF_2' )
| ~ sorti2(V_10) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_114,plain,
! [X_36] :
( ( h(op1(X_36,X_36)) != '#skF_2' )
| ~ sorti2(h(X_36))
| ~ sorti1(X_36)
| ~ sorti1(X_36) ),
inference(superposition,[status(thm),theory(equality)],[c_93,c_10]) ).
tff(c_161,plain,
! [U_43] :
( ( h(U_43) != '#skF_2' )
| ~ sorti2(h('#skF_1'(U_43)))
| ~ sorti1('#skF_1'(U_43))
| ~ sorti1('#skF_1'(U_43))
| ~ sorti1(U_43) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_114]) ).
tff(c_166,plain,
! [U_44] :
( ( h(U_44) != '#skF_2' )
| ~ sorti1(U_44)
| ~ sorti1('#skF_1'(U_44)) ),
inference(resolution,[status(thm)],[c_24,c_161]) ).
tff(c_171,plain,
! [U_45] :
( ( h(U_45) != '#skF_2' )
| ~ sorti1(U_45) ),
inference(resolution,[status(thm)],[c_8,c_166]) ).
tff(c_188,plain,
! [V_46] :
( ( h(j(V_46)) != '#skF_2' )
| ~ sorti2(V_46) ),
inference(resolution,[status(thm)],[c_22,c_171]) ).
tff(c_199,plain,
~ sorti2('#skF_2'),
inference(superposition,[status(thm),theory(equality)],[c_16,c_188]) ).
tff(c_12,plain,
sorti2('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_201,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_199,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG069+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/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.16/0.34 % Computer : n029.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 3 20:39:08 EDT 2023
% 0.16/0.35 % CPUTime :
% 3.13/1.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.13/1.85
% 3.13/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.30/1.87
% 3.30/1.87 Inference rules
% 3.30/1.87 ----------------------
% 3.30/1.87 #Ref : 0
% 3.30/1.87 #Sup : 45
% 3.30/1.87 #Fact : 0
% 3.30/1.87 #Define : 0
% 3.30/1.87 #Split : 0
% 3.30/1.87 #Chain : 0
% 3.30/1.87 #Close : 0
% 3.30/1.87
% 3.30/1.87 Ordering : KBO
% 3.30/1.87
% 3.30/1.87 Simplification rules
% 3.30/1.87 ----------------------
% 3.30/1.87 #Subsume : 6
% 3.30/1.87 #Demod : 0
% 3.30/1.87 #Tautology : 17
% 3.30/1.87 #SimpNegUnit : 1
% 3.30/1.87 #BackRed : 1
% 3.30/1.87
% 3.30/1.87 #Partial instantiations: 0
% 3.30/1.87 #Strategies tried : 1
% 3.30/1.87
% 3.30/1.87 Timing (in seconds)
% 3.30/1.87 ----------------------
% 3.30/1.88 Preprocessing : 0.48
% 3.30/1.88 Parsing : 0.26
% 3.30/1.88 CNF conversion : 0.03
% 3.37/1.88 Main loop : 0.28
% 3.37/1.88 Inferencing : 0.13
% 3.37/1.88 Reduction : 0.06
% 3.37/1.88 Demodulation : 0.04
% 3.37/1.88 BG Simplification : 0.02
% 3.37/1.88 Subsumption : 0.06
% 3.37/1.88 Abstraction : 0.01
% 3.37/1.88 MUC search : 0.00
% 3.37/1.88 Cooper : 0.00
% 3.37/1.88 Total : 0.81
% 3.37/1.88 Index Insertion : 0.00
% 3.37/1.88 Index Deletion : 0.00
% 3.37/1.88 Index Matching : 0.00
% 3.37/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------