TSTP Solution File: SEU134+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU134+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 : n012.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:42 EDT 2023
% Result : Theorem 2.93s 1.81s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 39 ( 14 unt; 11 typ; 0 def)
% Number of atoms : 42 ( 20 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 28 ( 14 ~; 11 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 17 (; 16 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > set_difference > #nlpp > empty_set > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_33,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_61,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_70,axiom,
! [A,B] :
( ( set_difference(A,B) = empty_set )
<=> subset(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_xboole_1) ).
tff(f_66,negated_conjecture,
~ ! [A,B] :
( ( set_difference(A,B) = empty_set )
<=> subset(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
tff(c_4,plain,
empty('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_47,plain,
! [A_16] :
( ( empty_set = A_16 )
| ~ empty(A_16) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_54,plain,
empty_set = '#skF_1',
inference(resolution,[status(thm)],[c_4,c_47]) ).
tff(c_34,plain,
! [A_12,B_13] :
( subset(A_12,B_13)
| ( set_difference(A_12,B_13) != empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_107,plain,
! [A_26,B_27] :
( subset(A_26,B_27)
| ( set_difference(A_26,B_27) != '#skF_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_34]) ).
tff(c_28,plain,
( subset('#skF_3','#skF_4')
| ~ subset('#skF_5','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_79,plain,
~ subset('#skF_5','#skF_6'),
inference(splitLeft,[status(thm)],[c_28]) ).
tff(c_111,plain,
set_difference('#skF_5','#skF_6') != '#skF_1',
inference(resolution,[status(thm)],[c_107,c_79]) ).
tff(c_32,plain,
( subset('#skF_3','#skF_4')
| ( set_difference('#skF_5','#skF_6') = empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_122,plain,
( subset('#skF_3','#skF_4')
| ( set_difference('#skF_5','#skF_6') = '#skF_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_32]) ).
tff(c_123,plain,
subset('#skF_3','#skF_4'),
inference(negUnitSimplification,[status(thm)],[c_111,c_122]) ).
tff(c_36,plain,
! [A_12,B_13] :
( ( set_difference(A_12,B_13) = empty_set )
| ~ subset(A_12,B_13) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_112,plain,
! [A_12,B_13] :
( ( set_difference(A_12,B_13) = '#skF_1' )
| ~ subset(A_12,B_13) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_36]) ).
tff(c_127,plain,
set_difference('#skF_3','#skF_4') = '#skF_1',
inference(resolution,[status(thm)],[c_123,c_112]) ).
tff(c_30,plain,
( ( set_difference('#skF_3','#skF_4') != empty_set )
| ( set_difference('#skF_5','#skF_6') = empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_158,plain,
set_difference('#skF_5','#skF_6') = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_54,c_127,c_54,c_30]) ).
tff(c_159,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_111,c_158]) ).
tff(c_161,plain,
subset('#skF_5','#skF_6'),
inference(splitRight,[status(thm)],[c_28]) ).
tff(c_26,plain,
( ( set_difference('#skF_3','#skF_4') != empty_set )
| ~ subset('#skF_5','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_188,plain,
set_difference('#skF_3','#skF_4') != '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_161,c_54,c_26]) ).
tff(c_160,plain,
subset('#skF_3','#skF_4'),
inference(splitRight,[status(thm)],[c_28]) ).
tff(c_193,plain,
! [A_40,B_41] :
( ( set_difference(A_40,B_41) = '#skF_1' )
| ~ subset(A_40,B_41) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_36]) ).
tff(c_202,plain,
set_difference('#skF_3','#skF_4') = '#skF_1',
inference(resolution,[status(thm)],[c_160,c_193]) ).
tff(c_211,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188,c_202]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU134+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/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.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 12:06:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.93/1.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.82
% 2.93/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.16/1.84
% 3.16/1.84 Inference rules
% 3.16/1.84 ----------------------
% 3.16/1.84 #Ref : 0
% 3.16/1.84 #Sup : 35
% 3.16/1.84 #Fact : 0
% 3.16/1.84 #Define : 0
% 3.16/1.84 #Split : 1
% 3.16/1.84 #Chain : 0
% 3.16/1.84 #Close : 0
% 3.16/1.84
% 3.16/1.84 Ordering : KBO
% 3.16/1.84
% 3.16/1.84 Simplification rules
% 3.16/1.84 ----------------------
% 3.16/1.84 #Subsume : 3
% 3.16/1.84 #Demod : 19
% 3.16/1.84 #Tautology : 30
% 3.16/1.84 #SimpNegUnit : 3
% 3.16/1.84 #BackRed : 3
% 3.16/1.84
% 3.16/1.84 #Partial instantiations: 0
% 3.16/1.84 #Strategies tried : 1
% 3.16/1.84
% 3.16/1.84 Timing (in seconds)
% 3.16/1.84 ----------------------
% 3.16/1.85 Preprocessing : 0.46
% 3.16/1.85 Parsing : 0.25
% 3.16/1.85 CNF conversion : 0.03
% 3.16/1.85 Main loop : 0.26
% 3.16/1.85 Inferencing : 0.10
% 3.16/1.85 Reduction : 0.07
% 3.16/1.85 Demodulation : 0.05
% 3.16/1.85 BG Simplification : 0.01
% 3.16/1.85 Subsumption : 0.06
% 3.16/1.85 Abstraction : 0.01
% 3.16/1.85 MUC search : 0.00
% 3.16/1.85 Cooper : 0.00
% 3.16/1.85 Total : 0.76
% 3.16/1.85 Index Insertion : 0.00
% 3.16/1.85 Index Deletion : 0.00
% 3.16/1.85 Index Matching : 0.00
% 3.16/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------