TSTP Solution File: SEU212+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU212+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 : n016.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:58:01 EDT 2023
% Result : Theorem 4.33s 2.33s
% Output : CNFRefutation 4.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 29
% Syntax : Number of formulae : 55 ( 16 unt; 26 typ; 0 def)
% Number of atoms : 64 ( 13 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 61 ( 26 ~; 21 |; 4 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 16 >; 10 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 10 con; 0-3 aty)
% Number of variables : 18 (; 17 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > element > relation_empty_yielding > relation > function > empty > unordered_pair > ordered_pair > apply > #nlpp > singleton > relation_dom > empty_set > #skF_5 > #skF_11 > #skF_4 > #skF_7 > #skF_3 > #skF_10 > #skF_14 > #skF_6 > #skF_13 > #skF_9 > #skF_8 > #skF_2 > #skF_1 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(apply,type,
apply: ( $i * $i ) > $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(function,type,
function: $i > $o ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_168,negated_conjecture,
~ ! [A,B,C] :
( ( relation(C)
& function(C) )
=> ( in(ordered_pair(A,B),C)
<=> ( in(A,relation_dom(C))
& ( B = apply(C,A) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_funct_1) ).
tff(f_59,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ! [B,C] :
( ( in(B,relation_dom(A))
=> ( ( C = apply(A,B) )
<=> in(ordered_pair(B,C),A) ) )
& ( ~ in(B,relation_dom(A))
=> ( ( C = apply(A,B) )
<=> ( C = empty_set ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_funct_1) ).
tff(f_70,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_dom(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(C,D),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
tff(c_112,plain,
( in(ordered_pair('#skF_12','#skF_13'),'#skF_14')
| ( apply('#skF_14','#skF_12') = '#skF_13' ) ),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_124,plain,
apply('#skF_14','#skF_12') = '#skF_13',
inference(splitLeft,[status(thm)],[c_112]) ).
tff(c_116,plain,
( in(ordered_pair('#skF_12','#skF_13'),'#skF_14')
| in('#skF_12',relation_dom('#skF_14')) ),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_120,plain,
in('#skF_12',relation_dom('#skF_14')),
inference(splitLeft,[status(thm)],[c_116]) ).
tff(c_106,plain,
( ( apply('#skF_14','#skF_12') != '#skF_13' )
| ~ in('#skF_12',relation_dom('#skF_14'))
| ~ in(ordered_pair('#skF_12','#skF_13'),'#skF_14') ),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_164,plain,
~ in(ordered_pair('#skF_12','#skF_13'),'#skF_14'),
inference(splitLeft,[status(thm)],[c_106]) ).
tff(c_104,plain,
relation('#skF_14'),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_102,plain,
function('#skF_14'),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_578,plain,
! [B_118,A_119] :
( in(ordered_pair(B_118,apply(A_119,B_118)),A_119)
| ~ in(B_118,relation_dom(A_119))
| ~ function(A_119)
| ~ relation(A_119) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_595,plain,
( in(ordered_pair('#skF_12','#skF_13'),'#skF_14')
| ~ in('#skF_12',relation_dom('#skF_14'))
| ~ function('#skF_14')
| ~ relation('#skF_14') ),
inference(superposition,[status(thm),theory(equality)],[c_124,c_578]) ).
tff(c_604,plain,
in(ordered_pair('#skF_12','#skF_13'),'#skF_14'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_102,c_120,c_595]) ).
tff(c_606,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_164,c_604]) ).
tff(c_607,plain,
( ~ in('#skF_12',relation_dom('#skF_14'))
| ( apply('#skF_14','#skF_12') != '#skF_13' ) ),
inference(splitRight,[status(thm)],[c_106]) ).
tff(c_717,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_124,c_120,c_607]) ).
tff(c_719,plain,
apply('#skF_14','#skF_12') != '#skF_13',
inference(splitRight,[status(thm)],[c_112]) ).
tff(c_718,plain,
in(ordered_pair('#skF_12','#skF_13'),'#skF_14'),
inference(splitRight,[status(thm)],[c_112]) ).
tff(c_1401,plain,
! [A_196,B_197,C_198] :
( ( apply(A_196,B_197) = C_198 )
| ~ in(ordered_pair(B_197,C_198),A_196)
| ~ in(B_197,relation_dom(A_196))
| ~ function(A_196)
| ~ relation(A_196) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_1418,plain,
( ( apply('#skF_14','#skF_12') = '#skF_13' )
| ~ in('#skF_12',relation_dom('#skF_14'))
| ~ function('#skF_14')
| ~ relation('#skF_14') ),
inference(resolution,[status(thm)],[c_718,c_1401]) ).
tff(c_1426,plain,
apply('#skF_14','#skF_12') = '#skF_13',
inference(demodulation,[status(thm),theory(equality)],[c_104,c_102,c_120,c_1418]) ).
tff(c_1428,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_719,c_1426]) ).
tff(c_1430,plain,
~ in('#skF_12',relation_dom('#skF_14')),
inference(splitRight,[status(thm)],[c_116]) ).
tff(c_1429,plain,
in(ordered_pair('#skF_12','#skF_13'),'#skF_14'),
inference(splitRight,[status(thm)],[c_116]) ).
tff(c_1789,plain,
! [C_238,A_239,D_240] :
( in(C_238,relation_dom(A_239))
| ~ in(ordered_pair(C_238,D_240),A_239)
| ~ relation(A_239) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_1796,plain,
( in('#skF_12',relation_dom('#skF_14'))
| ~ relation('#skF_14') ),
inference(resolution,[status(thm)],[c_1429,c_1789]) ).
tff(c_1800,plain,
in('#skF_12',relation_dom('#skF_14')),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_1796]) ).
tff(c_1802,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1430,c_1800]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU212+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.18/0.35 % Computer : n016.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 12:22:22 EDT 2023
% 0.18/0.36 % CPUTime :
% 4.33/2.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.33/2.33
% 4.33/2.33 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.33/2.36
% 4.33/2.36 Inference rules
% 4.33/2.36 ----------------------
% 4.33/2.36 #Ref : 0
% 4.33/2.36 #Sup : 408
% 4.33/2.36 #Fact : 0
% 4.33/2.36 #Define : 0
% 4.33/2.36 #Split : 9
% 4.33/2.36 #Chain : 0
% 4.33/2.36 #Close : 0
% 4.33/2.36
% 4.33/2.36 Ordering : KBO
% 4.33/2.36
% 4.33/2.36 Simplification rules
% 4.33/2.36 ----------------------
% 4.33/2.36 #Subsume : 52
% 4.33/2.36 #Demod : 148
% 4.33/2.36 #Tautology : 201
% 4.33/2.36 #SimpNegUnit : 16
% 4.33/2.36 #BackRed : 24
% 4.33/2.36
% 4.33/2.36 #Partial instantiations: 0
% 4.33/2.36 #Strategies tried : 1
% 4.33/2.36
% 4.33/2.36 Timing (in seconds)
% 4.33/2.36 ----------------------
% 4.33/2.36 Preprocessing : 0.56
% 4.33/2.36 Parsing : 0.28
% 4.33/2.36 CNF conversion : 0.05
% 4.33/2.36 Main loop : 0.65
% 4.33/2.36 Inferencing : 0.23
% 4.33/2.36 Reduction : 0.21
% 4.33/2.36 Demodulation : 0.15
% 4.33/2.36 BG Simplification : 0.03
% 4.33/2.36 Subsumption : 0.12
% 4.33/2.36 Abstraction : 0.02
% 4.33/2.36 MUC search : 0.00
% 4.33/2.36 Cooper : 0.00
% 4.33/2.36 Total : 1.26
% 4.33/2.36 Index Insertion : 0.00
% 4.33/2.36 Index Deletion : 0.00
% 4.33/2.36 Index Matching : 0.00
% 4.33/2.36 BG Taut test : 0.00
%------------------------------------------------------------------------------