TSTP Solution File: SEU150+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU150+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 : n020.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.78s 1.66s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 19 ( 9 unt; 5 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unordered_pair > #nlpp > singleton > #skF_2 > #skF_3 > #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_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_38,negated_conjecture,
~ ! [A,B,C] :
( ( singleton(A) = unordered_pair(B,C) )
=> ( B = C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
tff(f_33,axiom,
! [A,B,C] :
( ( singleton(A) = unordered_pair(B,C) )
=> ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
tff(f_28,axiom,
! [A,B] : ( unordered_pair(A,B) = unordered_pair(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
tff(c_12,plain,
unordered_pair('#skF_2','#skF_3') = singleton('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_67,plain,
! [B_8,A_9,C_10] :
( ( B_8 = A_9 )
| ( unordered_pair(B_8,C_10) != singleton(A_9) ) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_79,plain,
! [A_9] :
( ( A_9 = '#skF_2' )
| ( singleton(A_9) != singleton('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_67]) ).
tff(c_84,plain,
'#skF_2' = '#skF_1',
inference(reflexivity,[status(thm),theory(equality)],[c_79]) ).
tff(c_10,plain,
'#skF_2' != '#skF_3',
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_89,plain,
'#skF_3' != '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_84,c_10]) ).
tff(c_17,plain,
! [B_6,A_7] : ( unordered_pair(B_6,A_7) = unordered_pair(A_7,B_6) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_32,plain,
unordered_pair('#skF_3','#skF_2') = singleton('#skF_1'),
inference(superposition,[status(thm),theory(equality)],[c_17,c_12]) ).
tff(c_70,plain,
! [A_9] :
( ( A_9 = '#skF_3' )
| ( singleton(A_9) != singleton('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_67]) ).
tff(c_126,plain,
'#skF_3' = '#skF_1',
inference(reflexivity,[status(thm),theory(equality)],[c_70]) ).
tff(c_128,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_89,c_126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU150+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/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.16/0.37 % Computer : n020.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 11:43:52 EDT 2023
% 0.16/0.37 % CPUTime :
% 2.78/1.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.78/1.67
% 2.78/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.78/1.69
% 2.78/1.69 Inference rules
% 2.78/1.69 ----------------------
% 2.78/1.69 #Ref : 2
% 2.78/1.69 #Sup : 32
% 2.78/1.69 #Fact : 0
% 2.78/1.69 #Define : 0
% 2.78/1.69 #Split : 0
% 2.78/1.69 #Chain : 0
% 2.78/1.69 #Close : 0
% 2.78/1.69
% 2.78/1.69 Ordering : KBO
% 2.78/1.69
% 2.78/1.69 Simplification rules
% 2.78/1.69 ----------------------
% 2.78/1.69 #Subsume : 0
% 2.78/1.69 #Demod : 11
% 2.78/1.69 #Tautology : 27
% 2.78/1.69 #SimpNegUnit : 1
% 2.78/1.69 #BackRed : 4
% 2.78/1.69
% 2.78/1.69 #Partial instantiations: 0
% 2.78/1.69 #Strategies tried : 1
% 2.78/1.69
% 2.78/1.69 Timing (in seconds)
% 2.78/1.69 ----------------------
% 2.78/1.69 Preprocessing : 0.41
% 2.78/1.69 Parsing : 0.22
% 2.78/1.69 CNF conversion : 0.02
% 2.78/1.69 Main loop : 0.20
% 2.78/1.69 Inferencing : 0.08
% 2.78/1.69 Reduction : 0.06
% 2.78/1.69 Demodulation : 0.04
% 2.78/1.69 BG Simplification : 0.01
% 2.78/1.69 Subsumption : 0.04
% 2.78/1.69 Abstraction : 0.01
% 2.78/1.69 MUC search : 0.00
% 2.78/1.69 Cooper : 0.00
% 2.78/1.69 Total : 0.66
% 2.78/1.69 Index Insertion : 0.00
% 2.78/1.69 Index Deletion : 0.00
% 2.78/1.69 Index Matching : 0.00
% 2.78/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------