TSTP Solution File: SEU151+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU151+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/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 : n023.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 3.05s 1.76s
% Output : CNFRefutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 32 ( 18 unt; 8 typ; 0 def)
% Number of atoms : 35 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 9 ~; 7 |; 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 : 10 ( 4 >; 6 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > unordered_pair > #nlpp > #skF_1 > #skF_5 > #skF_6 > #skF_3 > #skF_2 > #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(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('#skF_4',type,
'#skF_4': $i ).
tff(f_53,negated_conjecture,
~ ! [A,B,C,D] :
~ ( ( unordered_pair(A,B) = unordered_pair(C,D) )
& ( A != C )
& ( A != D ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
tff(f_33,axiom,
! [A,B] : ( unordered_pair(A,B) = unordered_pair(B,A) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
tff(c_28,plain,
'#skF_5' != '#skF_3',
inference(cnfTransformation,[status(thm)],[f_53]) ).
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_30,plain,
unordered_pair('#skF_5','#skF_6') = unordered_pair('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_31,plain,
unordered_pair('#skF_5','#skF_6') = unordered_pair('#skF_4','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_30]) ).
tff(c_10,plain,
! [D_10,B_6] : in(D_10,unordered_pair(D_10,B_6)),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_95,plain,
in('#skF_5',unordered_pair('#skF_4','#skF_3')),
inference(superposition,[status(thm),theory(equality)],[c_31,c_10]) ).
tff(c_156,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_162,plain,
( ( '#skF_5' = '#skF_3' )
| ( '#skF_5' = '#skF_4' ) ),
inference(resolution,[status(thm)],[c_95,c_156]) ).
tff(c_183,plain,
'#skF_5' = '#skF_4',
inference(negUnitSimplification,[status(thm)],[c_28,c_162]) ).
tff(c_194,plain,
'#skF_3' != '#skF_4',
inference(demodulation,[status(thm),theory(equality)],[c_183,c_28]) ).
tff(c_26,plain,
'#skF_6' != '#skF_3',
inference(cnfTransformation,[status(thm)],[f_53]) ).
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_92,plain,
in('#skF_6',unordered_pair('#skF_4','#skF_3')),
inference(superposition,[status(thm),theory(equality)],[c_31,c_8]) ).
tff(c_165,plain,
( ( '#skF_6' = '#skF_3' )
| ( '#skF_6' = '#skF_4' ) ),
inference(resolution,[status(thm)],[c_92,c_156]) ).
tff(c_186,plain,
'#skF_6' = '#skF_4',
inference(negUnitSimplification,[status(thm)],[c_26,c_165]) ).
tff(c_86,plain,
unordered_pair('#skF_6','#skF_5') = unordered_pair('#skF_4','#skF_3'),
inference(superposition,[status(thm),theory(equality)],[c_31,c_4]) ).
tff(c_214,plain,
unordered_pair('#skF_4','#skF_3') = unordered_pair('#skF_4','#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_186,c_4,c_183,c_86]) ).
tff(c_227,plain,
in('#skF_3',unordered_pair('#skF_4','#skF_4')),
inference(superposition,[status(thm),theory(equality)],[c_214,c_8]) ).
tff(c_6,plain,
! [D_10,B_6,A_5] :
( ( D_10 = B_6 )
| ( D_10 = A_5 )
| ~ in(D_10,unordered_pair(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_235,plain,
'#skF_3' = '#skF_4',
inference(resolution,[status(thm)],[c_227,c_6]) ).
tff(c_241,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_194,c_194,c_235]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU151+1 : TPTP v8.1.2. Released v3.3.0.
% 0.14/0.14 % 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.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 11:50:37 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.05/1.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.05/1.77
% 3.05/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.14/1.79
% 3.14/1.79 Inference rules
% 3.14/1.79 ----------------------
% 3.14/1.79 #Ref : 0
% 3.14/1.79 #Sup : 57
% 3.14/1.79 #Fact : 0
% 3.14/1.79 #Define : 0
% 3.14/1.79 #Split : 0
% 3.14/1.79 #Chain : 0
% 3.14/1.79 #Close : 0
% 3.14/1.79
% 3.14/1.79 Ordering : KBO
% 3.14/1.79
% 3.14/1.79 Simplification rules
% 3.14/1.79 ----------------------
% 3.14/1.79 #Subsume : 14
% 3.14/1.79 #Demod : 25
% 3.14/1.79 #Tautology : 28
% 3.14/1.79 #SimpNegUnit : 3
% 3.14/1.79 #BackRed : 7
% 3.14/1.79
% 3.14/1.79 #Partial instantiations: 0
% 3.14/1.79 #Strategies tried : 1
% 3.14/1.79
% 3.14/1.79 Timing (in seconds)
% 3.14/1.79 ----------------------
% 3.14/1.79 Preprocessing : 0.47
% 3.14/1.80 Parsing : 0.24
% 3.14/1.80 CNF conversion : 0.03
% 3.14/1.80 Main loop : 0.27
% 3.14/1.80 Inferencing : 0.08
% 3.14/1.80 Reduction : 0.10
% 3.14/1.80 Demodulation : 0.07
% 3.14/1.80 BG Simplification : 0.02
% 3.14/1.80 Subsumption : 0.06
% 3.14/1.80 Abstraction : 0.01
% 3.14/1.80 MUC search : 0.00
% 3.14/1.80 Cooper : 0.00
% 3.14/1.80 Total : 0.78
% 3.14/1.80 Index Insertion : 0.00
% 3.14/1.80 Index Deletion : 0.00
% 3.14/1.80 Index Matching : 0.00
% 3.14/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------