TSTP Solution File: SEU188+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU188+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/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 : n015.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:57 EDT 2023
% Result : Theorem 3.95s 2.03s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 33
% Syntax : Number of formulae : 74 ( 28 unt; 26 typ; 0 def)
% Number of atoms : 77 ( 34 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 57 ( 28 ~; 19 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 20 >; 14 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 6 con; 0-3 aty)
% Number of variables : 18 (; 16 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > element > relation > empty > unordered_pair > ordered_pair > #nlpp > singleton > relation_rng > relation_dom > empty_set > #skF_9 > #skF_6 > #skF_11 > #skF_4 > #skF_3 > #skF_10 > #skF_16 > #skF_15 > #skF_13 > #skF_14 > #skF_2 > #skF_8 > #skF_7 > #skF_1 > #skF_5 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_110,axiom,
? [A] :
( empty(A)
& relation(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_relat_1) ).
tff(f_151,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
tff(f_112,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_147,negated_conjecture,
~ ! [A] :
( relation(A)
=> ( ( ( relation_dom(A) = empty_set )
| ( relation_rng(A) = empty_set ) )
=> ( A = empty_set ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t64_relat_1) ).
tff(f_86,axiom,
! [A] :
( ( ~ empty(A)
& relation(A) )
=> ~ empty(relation_dom(A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc5_relat_1) ).
tff(f_94,axiom,
! [A] :
( ( ~ empty(A)
& relation(A) )
=> ~ empty(relation_rng(A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_relat_1) ).
tff(f_100,axiom,
! [A] :
( empty(A)
=> ( empty(relation_dom(A))
& relation(relation_dom(A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc7_relat_1) ).
tff(c_76,plain,
empty('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_502,plain,
! [A_148] :
( ( empty_set = A_148 )
| ~ empty(A_148) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_513,plain,
empty_set = '#skF_10',
inference(resolution,[status(thm)],[c_76,c_502]) ).
tff(c_78,plain,
empty('#skF_11'),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_512,plain,
empty_set = '#skF_11',
inference(resolution,[status(thm)],[c_78,c_502]) ).
tff(c_528,plain,
'#skF_11' = '#skF_10',
inference(demodulation,[status(thm),theory(equality)],[c_513,c_512]) ).
tff(c_112,plain,
! [A_114] :
( ( empty_set = A_114 )
| ~ empty(A_114) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_123,plain,
empty_set = '#skF_10',
inference(resolution,[status(thm)],[c_76,c_112]) ).
tff(c_122,plain,
empty_set = '#skF_11',
inference(resolution,[status(thm)],[c_78,c_112]) ).
tff(c_136,plain,
'#skF_11' = '#skF_10',
inference(demodulation,[status(thm),theory(equality)],[c_123,c_122]) ).
tff(c_92,plain,
empty_set != '#skF_16',
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_128,plain,
'#skF_11' != '#skF_16',
inference(demodulation,[status(thm),theory(equality)],[c_122,c_92]) ).
tff(c_147,plain,
'#skF_10' != '#skF_16',
inference(demodulation,[status(thm),theory(equality)],[c_136,c_128]) ).
tff(c_96,plain,
relation('#skF_16'),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_94,plain,
( ( relation_rng('#skF_16') = empty_set )
| ( relation_dom('#skF_16') = empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_104,plain,
relation_dom('#skF_16') = empty_set,
inference(splitLeft,[status(thm)],[c_94]) ).
tff(c_127,plain,
relation_dom('#skF_16') = '#skF_11',
inference(demodulation,[status(thm),theory(equality)],[c_122,c_104]) ).
tff(c_146,plain,
relation_dom('#skF_16') = '#skF_10',
inference(demodulation,[status(thm),theory(equality)],[c_136,c_127]) ).
tff(c_428,plain,
! [A_140] :
( ~ empty(relation_dom(A_140))
| ~ relation(A_140)
| empty(A_140) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_443,plain,
( ~ empty('#skF_10')
| ~ relation('#skF_16')
| empty('#skF_16') ),
inference(superposition,[status(thm),theory(equality)],[c_146,c_428]) ).
tff(c_452,plain,
empty('#skF_16'),
inference(demodulation,[status(thm),theory(equality)],[c_96,c_76,c_443]) ).
tff(c_98,plain,
! [A_106] :
( ( empty_set = A_106 )
| ~ empty(A_106) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_126,plain,
! [A_106] :
( ( A_106 = '#skF_11' )
| ~ empty(A_106) ),
inference(demodulation,[status(thm),theory(equality)],[c_122,c_98]) ).
tff(c_161,plain,
! [A_106] :
( ( A_106 = '#skF_10' )
| ~ empty(A_106) ),
inference(demodulation,[status(thm),theory(equality)],[c_136,c_126]) ).
tff(c_483,plain,
'#skF_10' = '#skF_16',
inference(resolution,[status(thm)],[c_452,c_161]) ).
tff(c_491,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_147,c_483]) ).
tff(c_493,plain,
relation_dom('#skF_16') != empty_set,
inference(splitRight,[status(thm)],[c_94]) ).
tff(c_518,plain,
relation_dom('#skF_16') != '#skF_11',
inference(demodulation,[status(thm),theory(equality)],[c_512,c_493]) ).
tff(c_547,plain,
relation_dom('#skF_16') != '#skF_10',
inference(demodulation,[status(thm),theory(equality)],[c_528,c_518]) ).
tff(c_492,plain,
relation_rng('#skF_16') = empty_set,
inference(splitRight,[status(thm)],[c_94]) ).
tff(c_519,plain,
relation_rng('#skF_16') = '#skF_11',
inference(demodulation,[status(thm),theory(equality)],[c_512,c_492]) ).
tff(c_542,plain,
relation_rng('#skF_16') = '#skF_10',
inference(demodulation,[status(thm),theory(equality)],[c_528,c_519]) ).
tff(c_835,plain,
! [A_172] :
( ~ empty(relation_rng(A_172))
| ~ relation(A_172)
| empty(A_172) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_850,plain,
( ~ empty('#skF_10')
| ~ relation('#skF_16')
| empty('#skF_16') ),
inference(superposition,[status(thm),theory(equality)],[c_542,c_835]) ).
tff(c_859,plain,
empty('#skF_16'),
inference(demodulation,[status(thm),theory(equality)],[c_96,c_76,c_850]) ).
tff(c_560,plain,
! [A_152] :
( empty(relation_dom(A_152))
| ~ empty(A_152) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_517,plain,
! [A_106] :
( ( A_106 = '#skF_11' )
| ~ empty(A_106) ),
inference(demodulation,[status(thm),theory(equality)],[c_512,c_98]) ).
tff(c_548,plain,
! [A_106] :
( ( A_106 = '#skF_10' )
| ~ empty(A_106) ),
inference(demodulation,[status(thm),theory(equality)],[c_528,c_517]) ).
tff(c_564,plain,
! [A_152] :
( ( relation_dom(A_152) = '#skF_10' )
| ~ empty(A_152) ),
inference(resolution,[status(thm)],[c_560,c_548]) ).
tff(c_867,plain,
relation_dom('#skF_16') = '#skF_10',
inference(resolution,[status(thm)],[c_859,c_564]) ).
tff(c_877,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_547,c_867]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU188+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/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 : n015.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:54:44 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.95/2.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.95/2.03
% 3.95/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.95/2.06
% 3.95/2.06 Inference rules
% 3.95/2.06 ----------------------
% 3.95/2.06 #Ref : 0
% 3.95/2.06 #Sup : 182
% 3.95/2.06 #Fact : 0
% 3.95/2.06 #Define : 0
% 3.95/2.06 #Split : 1
% 3.95/2.06 #Chain : 0
% 3.95/2.06 #Close : 0
% 3.95/2.06
% 3.95/2.06 Ordering : KBO
% 3.95/2.06
% 3.95/2.06 Simplification rules
% 3.95/2.06 ----------------------
% 3.95/2.06 #Subsume : 14
% 3.95/2.06 #Demod : 133
% 3.95/2.06 #Tautology : 150
% 3.95/2.06 #SimpNegUnit : 2
% 3.95/2.06 #BackRed : 20
% 3.95/2.06
% 3.95/2.06 #Partial instantiations: 0
% 3.95/2.06 #Strategies tried : 1
% 3.95/2.06
% 3.95/2.06 Timing (in seconds)
% 3.95/2.06 ----------------------
% 3.95/2.07 Preprocessing : 0.57
% 3.95/2.07 Parsing : 0.28
% 3.95/2.07 CNF conversion : 0.05
% 3.95/2.07 Main loop : 0.41
% 3.95/2.07 Inferencing : 0.13
% 3.95/2.07 Reduction : 0.13
% 3.95/2.07 Demodulation : 0.09
% 3.95/2.07 BG Simplification : 0.03
% 3.95/2.07 Subsumption : 0.09
% 3.95/2.07 Abstraction : 0.02
% 3.95/2.07 MUC search : 0.00
% 3.95/2.07 Cooper : 0.00
% 3.95/2.07 Total : 1.03
% 3.95/2.07 Index Insertion : 0.00
% 3.95/2.07 Index Deletion : 0.00
% 3.95/2.07 Index Matching : 0.00
% 3.95/2.07 BG Taut test : 0.00
%------------------------------------------------------------------------------