TSTP Solution File: SEU142+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU142+1 : TPTP v8.1.2. Released v3.3.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 : n021.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:57:44 EDT 2023
% Result : Theorem 3.26s 2.09s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 30 ( 5 unt; 10 typ; 0 def)
% Number of atoms : 52 ( 40 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 44 ( 12 ~; 28 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 9 >; 10 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-3 aty)
% Number of variables : 37 (; 37 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > unordered_pair > #nlpp > singleton > #skF_6 > #skF_4 > #skF_7 > #skF_3 > #skF_2 > #skF_1 > #skF_5
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff(f_40,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
tff(f_49,axiom,
! [A,B,C] :
( ( C = unordered_pair(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( ( D = A )
| ( D = B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
tff(f_60,negated_conjecture,
~ ! [A] : ( unordered_pair(A,A) = singleton(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
tff(c_8,plain,
! [C_9] : in(C_9,singleton(C_9)),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_432,plain,
! [A_104,B_105,C_106] :
( ( '#skF_3'(A_104,B_105,C_106) = B_105 )
| ( '#skF_3'(A_104,B_105,C_106) = A_104 )
| in('#skF_4'(A_104,B_105,C_106),C_106)
| ( unordered_pair(A_104,B_105) = C_106 ) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_6,plain,
! [C_9,A_5] :
( ( C_9 = A_5 )
| ~ in(C_9,singleton(A_5)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_521,plain,
! [A_116,B_117,A_118] :
( ( '#skF_4'(A_116,B_117,singleton(A_118)) = A_118 )
| ( '#skF_3'(A_116,B_117,singleton(A_118)) = B_117 )
| ( '#skF_3'(A_116,B_117,singleton(A_118)) = A_116 )
| ( unordered_pair(A_116,B_117) = singleton(A_118) ) ),
inference(resolution,[status(thm)],[c_432,c_6]) ).
tff(c_30,plain,
! [A_10,B_11,C_12] :
( ( '#skF_3'(A_10,B_11,C_12) = B_11 )
| ( '#skF_3'(A_10,B_11,C_12) = A_10 )
| ( '#skF_4'(A_10,B_11,C_12) != A_10 )
| ( unordered_pair(A_10,B_11) = C_12 ) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_543,plain,
! [A_118,B_117] :
( ( '#skF_3'(A_118,B_117,singleton(A_118)) = B_117 )
| ( '#skF_3'(A_118,B_117,singleton(A_118)) = A_118 )
| ( unordered_pair(A_118,B_117) = singleton(A_118) ) ),
inference(superposition,[status(thm),theory(equality)],[c_521,c_30]) ).
tff(c_621,plain,
! [B_121] :
( ( unordered_pair(B_121,B_121) = singleton(B_121) )
| ( '#skF_3'(B_121,B_121,singleton(B_121)) = B_121 ) ),
inference(factorization,[status(thm),theory(equality)],[c_543]) ).
tff(c_368,plain,
! [A_83,B_84,C_85] :
( ~ in('#skF_3'(A_83,B_84,C_85),C_85)
| in('#skF_4'(A_83,B_84,C_85),C_85)
| ( unordered_pair(A_83,B_84) = C_85 ) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_386,plain,
! [A_83,B_84,A_5] :
( ( '#skF_4'(A_83,B_84,singleton(A_5)) = A_5 )
| ~ in('#skF_3'(A_83,B_84,singleton(A_5)),singleton(A_5))
| ( unordered_pair(A_83,B_84) = singleton(A_5) ) ),
inference(resolution,[status(thm)],[c_368,c_6]) ).
tff(c_633,plain,
! [B_121] :
( ( '#skF_4'(B_121,B_121,singleton(B_121)) = B_121 )
| ~ in(B_121,singleton(B_121))
| ( unordered_pair(B_121,B_121) = singleton(B_121) )
| ( unordered_pair(B_121,B_121) = singleton(B_121) ) ),
inference(superposition,[status(thm),theory(equality)],[c_621,c_386]) ).
tff(c_652,plain,
! [B_121] :
( ( '#skF_4'(B_121,B_121,singleton(B_121)) = B_121 )
| ( unordered_pair(B_121,B_121) = singleton(B_121) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_633]) ).
tff(c_28,plain,
! [A_10,B_11,C_12] :
( ~ in('#skF_3'(A_10,B_11,C_12),C_12)
| ( '#skF_4'(A_10,B_11,C_12) != A_10 )
| ( unordered_pair(A_10,B_11) = C_12 ) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_639,plain,
! [B_121] :
( ~ in(B_121,singleton(B_121))
| ( '#skF_4'(B_121,B_121,singleton(B_121)) != B_121 )
| ( unordered_pair(B_121,B_121) = singleton(B_121) )
| ( unordered_pair(B_121,B_121) = singleton(B_121) ) ),
inference(superposition,[status(thm),theory(equality)],[c_621,c_28]) ).
tff(c_693,plain,
! [B_123] :
( ( '#skF_4'(B_123,B_123,singleton(B_123)) != B_123 )
| ( unordered_pair(B_123,B_123) = singleton(B_123) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_639]) ).
tff(c_701,plain,
! [B_121] : ( unordered_pair(B_121,B_121) = singleton(B_121) ),
inference(superposition,[status(thm),theory(equality)],[c_652,c_693]) ).
tff(c_48,plain,
unordered_pair('#skF_7','#skF_7') != singleton('#skF_7'),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_708,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_701,c_48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU142+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % 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.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 12:08:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.26/2.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/2.09
% 3.26/2.09 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.26/2.12
% 3.26/2.12 Inference rules
% 3.26/2.12 ----------------------
% 3.26/2.12 #Ref : 0
% 3.26/2.12 #Sup : 141
% 3.26/2.12 #Fact : 2
% 3.26/2.12 #Define : 0
% 3.26/2.12 #Split : 0
% 3.26/2.12 #Chain : 0
% 3.26/2.12 #Close : 0
% 3.26/2.12
% 3.26/2.12 Ordering : KBO
% 3.26/2.12
% 3.26/2.12 Simplification rules
% 3.26/2.12 ----------------------
% 3.26/2.12 #Subsume : 28
% 3.26/2.12 #Demod : 25
% 3.26/2.12 #Tautology : 52
% 3.26/2.12 #SimpNegUnit : 0
% 3.26/2.12 #BackRed : 1
% 3.26/2.12
% 3.26/2.12 #Partial instantiations: 0
% 3.26/2.12 #Strategies tried : 1
% 3.26/2.12
% 3.26/2.12 Timing (in seconds)
% 3.26/2.12 ----------------------
% 3.26/2.12 Preprocessing : 0.46
% 3.26/2.12 Parsing : 0.23
% 3.26/2.12 CNF conversion : 0.03
% 3.26/2.12 Main loop : 0.44
% 3.26/2.12 Inferencing : 0.18
% 3.26/2.12 Reduction : 0.11
% 3.26/2.12 Demodulation : 0.08
% 3.26/2.12 BG Simplification : 0.03
% 3.26/2.13 Subsumption : 0.10
% 3.26/2.13 Abstraction : 0.03
% 3.26/2.13 MUC search : 0.00
% 3.26/2.13 Cooper : 0.00
% 3.26/2.13 Total : 0.94
% 3.26/2.13 Index Insertion : 0.00
% 3.26/2.13 Index Deletion : 0.00
% 3.26/2.13 Index Matching : 0.00
% 3.26/2.13 BG Taut test : 0.00
%------------------------------------------------------------------------------