TSTP Solution File: SEU151+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU151+3 : 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/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 : n009.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:47 EDT 2023
% Result : Theorem 2.79s 1.77s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 21 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 5 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > unordered_pair > #nlpp > #skF_1 > #skF_7 > #skF_5 > #skF_6 > #skF_3 > #skF_2 > #skF_8 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(unordered_pair,type,
unordered_pair: ( $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 ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_57,negated_conjecture,
~ ! [A,B,C,D] :
~ ( ( unordered_pair(A,B) = unordered_pair(C,D) )
& ( A != C )
& ( A != D ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1) ).
tff(f_33,axiom,
! [A,B] : ( unordered_pair(A,B) = unordered_pair(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
tff(f_42,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(c_28,plain,
'#skF_5' != '#skF_8',
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_30,plain,
'#skF_7' != '#skF_5',
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_4,plain,
! [B_4,A_3] : ( unordered_pair(B_4,A_3) = unordered_pair(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_32,plain,
unordered_pair('#skF_7','#skF_8') = unordered_pair('#skF_5','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_33,plain,
unordered_pair('#skF_6','#skF_5') = unordered_pair('#skF_8','#skF_7'),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_32]) ).
tff(c_8,plain,
! [D_10,A_5] : in(D_10,unordered_pair(A_5,D_10)),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_88,plain,
in('#skF_5',unordered_pair('#skF_8','#skF_7')),
inference(superposition,[status(thm),theory(equality)],[c_33,c_8]) ).
tff(c_128,plain,
! [D_23,B_24,A_25] :
( ( D_23 = B_24 )
| ( D_23 = A_25 )
| ~ in(D_23,unordered_pair(A_25,B_24)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_134,plain,
( ( '#skF_7' = '#skF_5' )
| ( '#skF_5' = '#skF_8' ) ),
inference(resolution,[status(thm)],[c_88,c_128]) ).
tff(c_154,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_30,c_134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU151+3 : TPTP v8.1.2. Released v3.2.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 : n009.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 11:52:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.79/1.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.79/1.77
% 2.79/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.00/1.79
% 3.00/1.79 Inference rules
% 3.00/1.79 ----------------------
% 3.00/1.79 #Ref : 0
% 3.00/1.79 #Sup : 33
% 3.00/1.79 #Fact : 0
% 3.00/1.79 #Define : 0
% 3.00/1.79 #Split : 0
% 3.00/1.79 #Chain : 0
% 3.00/1.79 #Close : 0
% 3.00/1.79
% 3.00/1.79 Ordering : KBO
% 3.00/1.79
% 3.00/1.79 Simplification rules
% 3.00/1.79 ----------------------
% 3.00/1.79 #Subsume : 2
% 3.00/1.79 #Demod : 6
% 3.00/1.79 #Tautology : 14
% 3.00/1.79 #SimpNegUnit : 1
% 3.00/1.79 #BackRed : 0
% 3.00/1.79
% 3.00/1.79 #Partial instantiations: 0
% 3.00/1.79 #Strategies tried : 1
% 3.00/1.79
% 3.00/1.79 Timing (in seconds)
% 3.00/1.79 ----------------------
% 3.00/1.80 Preprocessing : 0.47
% 3.00/1.80 Parsing : 0.23
% 3.00/1.80 CNF conversion : 0.03
% 3.00/1.80 Main loop : 0.20
% 3.00/1.80 Inferencing : 0.06
% 3.00/1.80 Reduction : 0.07
% 3.00/1.80 Demodulation : 0.05
% 3.00/1.80 BG Simplification : 0.02
% 3.00/1.80 Subsumption : 0.05
% 3.00/1.80 Abstraction : 0.01
% 3.00/1.80 MUC search : 0.00
% 3.00/1.80 Cooper : 0.00
% 3.00/1.80 Total : 0.71
% 3.00/1.80 Index Insertion : 0.00
% 3.00/1.80 Index Deletion : 0.00
% 3.00/1.80 Index Matching : 0.00
% 3.00/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------