TSTP Solution File: SEU123+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU123+2 : 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:39 EDT 2023
% Result : Theorem 3.93s 1.89s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 33 ( 12 unt; 15 typ; 0 def)
% Number of atoms : 26 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 11 >; 11 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 11 (; 10 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_intersection2 > #nlpp > empty_set > #skF_1 > #skF_4 > #skF_5 > #skF_6 > #skF_8 > #skF_3 > #skF_2 > #skF_7 > #skF_9
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $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(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(f_71,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_129,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_111,negated_conjecture,
~ ! [A] :
( subset(A,empty_set)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
tff(f_88,lemma,
! [A] : subset(empty_set,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
tff(f_39,axiom,
! [A,B] :
( ( A = B )
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
tff(c_52,plain,
empty('#skF_5'),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_88,plain,
! [A_52] :
( ( empty_set = A_52 )
| ~ empty(A_52) ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_97,plain,
empty_set = '#skF_5',
inference(resolution,[status(thm)],[c_52,c_88]) ).
tff(c_70,plain,
empty_set != '#skF_8',
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_112,plain,
'#skF_5' != '#skF_8',
inference(demodulation,[status(thm),theory(equality)],[c_97,c_70]) ).
tff(c_62,plain,
! [A_33] : subset(empty_set,A_33),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_109,plain,
! [A_33] : subset('#skF_5',A_33),
inference(demodulation,[status(thm),theory(equality)],[c_97,c_62]) ).
tff(c_72,plain,
subset('#skF_8',empty_set),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_108,plain,
subset('#skF_8','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_97,c_72]) ).
tff(c_453,plain,
! [B_103,A_104] :
( ( B_103 = A_104 )
| ~ subset(B_103,A_104)
| ~ subset(A_104,B_103) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_457,plain,
( ( '#skF_5' = '#skF_8' )
| ~ subset('#skF_5','#skF_8') ),
inference(resolution,[status(thm)],[c_108,c_453]) ).
tff(c_463,plain,
'#skF_5' = '#skF_8',
inference(demodulation,[status(thm),theory(equality)],[c_109,c_457]) ).
tff(c_465,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_112,c_463]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU123+2 : 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 : n020.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 11:50:07 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.93/1.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.93/1.89
% 3.93/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.02/1.92
% 4.02/1.92 Inference rules
% 4.02/1.92 ----------------------
% 4.02/1.92 #Ref : 0
% 4.02/1.92 #Sup : 84
% 4.02/1.92 #Fact : 0
% 4.02/1.92 #Define : 0
% 4.02/1.92 #Split : 0
% 4.02/1.92 #Chain : 0
% 4.02/1.92 #Close : 0
% 4.02/1.92
% 4.02/1.92 Ordering : KBO
% 4.02/1.92
% 4.02/1.92 Simplification rules
% 4.02/1.92 ----------------------
% 4.02/1.92 #Subsume : 17
% 4.02/1.92 #Demod : 29
% 4.02/1.92 #Tautology : 45
% 4.02/1.92 #SimpNegUnit : 2
% 4.02/1.92 #BackRed : 6
% 4.02/1.92
% 4.02/1.92 #Partial instantiations: 0
% 4.02/1.92 #Strategies tried : 1
% 4.02/1.92
% 4.02/1.92 Timing (in seconds)
% 4.02/1.92 ----------------------
% 4.02/1.92 Preprocessing : 0.56
% 4.02/1.92 Parsing : 0.28
% 4.02/1.92 CNF conversion : 0.04
% 4.02/1.92 Main loop : 0.35
% 4.02/1.92 Inferencing : 0.12
% 4.02/1.92 Reduction : 0.11
% 4.02/1.92 Demodulation : 0.08
% 4.02/1.92 BG Simplification : 0.03
% 4.02/1.92 Subsumption : 0.08
% 4.02/1.92 Abstraction : 0.02
% 4.02/1.92 MUC search : 0.00
% 4.02/1.92 Cooper : 0.00
% 4.02/1.92 Total : 0.95
% 4.02/1.92 Index Insertion : 0.00
% 4.02/1.92 Index Deletion : 0.00
% 4.02/1.92 Index Matching : 0.00
% 4.02/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------