TSTP Solution File: SEU149+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU149+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 : n011.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:46 EDT 2023
% Result : Theorem 2.34s 1.71s
% Output : CNFRefutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 20 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 17 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 10 ( 3 ~; 2 |; 0 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 7 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > unordered_pair > #nlpp > singleton > #skF_4 > #skF_7 > #skF_5 > #skF_6 > #skF_3 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
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(f_55,negated_conjecture,
~ ! [A,B,C] :
( ( singleton(A) = unordered_pair(B,C) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
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_40,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
tff(c_40,plain,
'#skF_5' != '#skF_6',
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_42,plain,
unordered_pair('#skF_6','#skF_7') = singleton('#skF_5'),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_48,plain,
! [D_17,B_18] : in(D_17,unordered_pair(D_17,B_18)),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_51,plain,
in('#skF_6',singleton('#skF_5')),
inference(superposition,[status(thm),theory(equality)],[c_42,c_48]) ).
tff(c_142,plain,
! [C_30,A_31] :
( ( C_30 = A_31 )
| ~ in(C_30,singleton(A_31)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_148,plain,
'#skF_5' = '#skF_6',
inference(resolution,[status(thm)],[c_51,c_142]) ).
tff(c_156,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU149+1 : TPTP v8.1.2. Released v3.3.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.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 12:01:21 EDT 2023
% 0.16/0.37 % CPUTime :
% 2.34/1.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.34/1.72
% 2.34/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.34/1.74
% 2.34/1.74 Inference rules
% 2.34/1.74 ----------------------
% 2.34/1.74 #Ref : 0
% 2.34/1.74 #Sup : 30
% 2.34/1.74 #Fact : 0
% 2.34/1.74 #Define : 0
% 2.34/1.74 #Split : 0
% 2.34/1.74 #Chain : 0
% 2.34/1.74 #Close : 0
% 2.34/1.74
% 2.34/1.74 Ordering : KBO
% 2.34/1.74
% 2.34/1.74 Simplification rules
% 2.34/1.74 ----------------------
% 2.34/1.74 #Subsume : 6
% 2.34/1.74 #Demod : 4
% 2.34/1.74 #Tautology : 16
% 2.34/1.74 #SimpNegUnit : 1
% 2.34/1.74 #BackRed : 0
% 2.34/1.74
% 2.34/1.74 #Partial instantiations: 0
% 2.34/1.74 #Strategies tried : 1
% 2.34/1.74
% 2.34/1.74 Timing (in seconds)
% 2.34/1.74 ----------------------
% 2.34/1.74 Preprocessing : 0.47
% 2.34/1.74 Parsing : 0.23
% 2.34/1.74 CNF conversion : 0.03
% 2.34/1.74 Main loop : 0.21
% 2.34/1.74 Inferencing : 0.07
% 2.34/1.74 Reduction : 0.07
% 2.34/1.75 Demodulation : 0.05
% 2.34/1.75 BG Simplification : 0.02
% 2.34/1.75 Subsumption : 0.05
% 2.34/1.75 Abstraction : 0.01
% 2.34/1.75 MUC search : 0.00
% 2.34/1.75 Cooper : 0.00
% 2.34/1.75 Total : 0.72
% 2.34/1.75 Index Insertion : 0.00
% 2.34/1.75 Index Deletion : 0.00
% 2.34/1.75 Index Matching : 0.00
% 2.34/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------