TSTP Solution File: NUM385+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM385+1 : TPTP v8.1.2. Released v3.2.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 : n004.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:51:34 EDT 2023
% Result : Theorem 6.40s 2.67s
% Output : CNFRefutation 6.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 35
% Syntax : Number of formulae : 56 ( 16 unt; 29 typ; 0 def)
% Number of atoms : 44 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 10 ~; 11 |; 0 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 16 >; 9 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 13 con; 0-3 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > element > relation_non_empty > relation_empty_yielding > relation > one_to_one > function > empty > set_union2 > #nlpp > succ > singleton > empty_set > #skF_5 > #skF_17 > #skF_11 > #skF_15 > #skF_4 > #skF_7 > #skF_10 > #skF_16 > #skF_14 > #skF_6 > #skF_13 > #skF_9 > #skF_8 > #skF_3 > #skF_2 > #skF_1 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(relation_non_empty,type,
relation_non_empty: $i > $o ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(function,type,
function: $i > $o ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(succ,type,
succ: $i > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_159,negated_conjecture,
~ ! [A,B] :
( ( succ(A) = succ(B) )
=> ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_ordinal1) ).
tff(f_154,axiom,
! [A] : in(A,succ(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
tff(f_55,axiom,
! [A] : ( succ(A) = set_union2(A,singleton(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
tff(f_71,axiom,
! [A,B,C] :
( ( C = set_union2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
tff(f_31,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
tff(f_62,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
tff(c_118,plain,
'#skF_17' != '#skF_16',
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_120,plain,
succ('#skF_17') = succ('#skF_16'),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_153,plain,
! [A_45] : in(A_45,succ(A_45)),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_156,plain,
in('#skF_17',succ('#skF_16')),
inference(superposition,[status(thm),theory(equality)],[c_120,c_153]) ).
tff(c_16,plain,
! [A_8] : ( set_union2(A_8,singleton(A_8)) = succ(A_8) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_916,plain,
! [D_109,B_110,A_111] :
( in(D_109,B_110)
| in(D_109,A_111)
| ~ in(D_109,set_union2(A_111,B_110)) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_3480,plain,
! [D_226,A_227] :
( in(D_226,singleton(A_227))
| in(D_226,A_227)
| ~ in(D_226,succ(A_227)) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_916]) ).
tff(c_3547,plain,
( in('#skF_17',singleton('#skF_16'))
| in('#skF_17','#skF_16') ),
inference(resolution,[status(thm)],[c_156,c_3480]) ).
tff(c_3550,plain,
in('#skF_17','#skF_16'),
inference(splitLeft,[status(thm)],[c_3547]) ).
tff(c_2,plain,
! [B_2,A_1] :
( ~ in(B_2,A_1)
| ~ in(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_3565,plain,
~ in('#skF_16','#skF_17'),
inference(resolution,[status(thm)],[c_3550,c_2]) ).
tff(c_116,plain,
! [A_31] : in(A_31,succ(A_31)),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_3568,plain,
! [D_228] :
( in(D_228,singleton('#skF_17'))
| in(D_228,'#skF_17')
| ~ in(D_228,succ('#skF_16')) ),
inference(superposition,[status(thm),theory(equality)],[c_120,c_3480]) ).
tff(c_3633,plain,
( in('#skF_16',singleton('#skF_17'))
| in('#skF_16','#skF_17') ),
inference(resolution,[status(thm)],[c_116,c_3568]) ).
tff(c_3640,plain,
in('#skF_16',singleton('#skF_17')),
inference(negUnitSimplification,[status(thm)],[c_3565,c_3633]) ).
tff(c_18,plain,
! [C_13,A_9] :
( ( C_13 = A_9 )
| ~ in(C_13,singleton(A_9)) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_3651,plain,
'#skF_17' = '#skF_16',
inference(resolution,[status(thm)],[c_3640,c_18]) ).
tff(c_3667,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_3651]) ).
tff(c_3668,plain,
in('#skF_17',singleton('#skF_16')),
inference(splitRight,[status(thm)],[c_3547]) ).
tff(c_3684,plain,
'#skF_17' = '#skF_16',
inference(resolution,[status(thm)],[c_3668,c_18]) ).
tff(c_3700,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_3684]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM385+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % 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.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 14:19:41 EDT 2023
% 0.14/0.35 % CPUTime :
% 6.40/2.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.40/2.68
% 6.40/2.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.40/2.71
% 6.40/2.71 Inference rules
% 6.40/2.71 ----------------------
% 6.40/2.71 #Ref : 0
% 6.40/2.71 #Sup : 827
% 6.40/2.71 #Fact : 2
% 6.40/2.71 #Define : 0
% 6.40/2.71 #Split : 10
% 6.40/2.71 #Chain : 0
% 6.40/2.71 #Close : 0
% 6.40/2.71
% 6.40/2.71 Ordering : KBO
% 6.40/2.71
% 6.40/2.71 Simplification rules
% 6.40/2.71 ----------------------
% 6.40/2.71 #Subsume : 259
% 6.40/2.71 #Demod : 71
% 6.40/2.71 #Tautology : 123
% 6.40/2.71 #SimpNegUnit : 37
% 6.40/2.71 #BackRed : 10
% 6.40/2.71
% 6.40/2.71 #Partial instantiations: 0
% 6.40/2.71 #Strategies tried : 1
% 6.40/2.71
% 6.40/2.71 Timing (in seconds)
% 6.40/2.71 ----------------------
% 6.40/2.71 Preprocessing : 0.58
% 6.40/2.71 Parsing : 0.29
% 6.40/2.71 CNF conversion : 0.05
% 6.40/2.71 Main loop : 1.06
% 6.40/2.71 Inferencing : 0.33
% 6.40/2.71 Reduction : 0.35
% 6.40/2.71 Demodulation : 0.23
% 6.40/2.71 BG Simplification : 0.04
% 6.40/2.71 Subsumption : 0.24
% 6.40/2.71 Abstraction : 0.03
% 6.40/2.71 MUC search : 0.00
% 6.40/2.71 Cooper : 0.00
% 6.40/2.71 Total : 1.69
% 6.40/2.71 Index Insertion : 0.00
% 6.40/2.71 Index Deletion : 0.00
% 6.40/2.71 Index Matching : 0.00
% 6.40/2.71 BG Taut test : 0.00
%------------------------------------------------------------------------------