TSTP Solution File: SEU240+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU240+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 : n011.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:08 EDT 2023
% Result : Theorem 5.83s 2.38s
% Output : CNFRefutation 5.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 33
% Syntax : Number of formulae : 73 ( 13 unt; 29 typ; 0 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 145 ( 65 ~; 64 |; 6 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 19 >; 9 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 10 con; 0-2 aty)
% Number of variables : 52 (; 52 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_transitive_in > in > element > transitive > relation > one_to_one > function > empty > unordered_pair > set_union2 > ordered_pair > #nlpp > singleton > relation_rng > relation_field > relation_dom > empty_set > #skF_4 > #skF_11 > #skF_7 > #skF_3 > #skF_10 > #skF_5 > #skF_6 > #skF_13 > #skF_9 > #skF_8 > #skF_2 > #skF_1 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation_field,type,
relation_field: $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_4',type,
'#skF_4': $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(one_to_one,type,
one_to_one: $i > $o ).
tff(function,type,
function: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
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_5',type,
'#skF_5': $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(transitive,type,
transitive: $i > $o ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff(is_transitive_in,type,
is_transitive_in: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_115,negated_conjecture,
~ ! [A] :
( relation(A)
=> ( transitive(A)
<=> ! [B,C,D] :
( ( in(ordered_pair(B,C),A)
& in(ordered_pair(C,D),A) )
=> in(ordered_pair(B,D),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_wellord1) ).
tff(f_81,axiom,
! [A] :
( relation(A)
=> ! [B] :
( is_transitive_in(A,B)
<=> ! [C,D,E] :
( ( in(C,B)
& in(D,B)
& in(E,B)
& in(ordered_pair(C,D),A)
& in(ordered_pair(D,E),A) )
=> in(ordered_pair(C,E),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_relat_2) ).
tff(f_57,axiom,
! [A] :
( relation(A)
=> ( transitive(A)
<=> is_transitive_in(A,relation_field(A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_relat_2) ).
tff(f_156,axiom,
! [A,B,C] :
( relation(C)
=> ( in(ordered_pair(A,B),C)
=> ( in(A,relation_field(C))
& in(B,relation_field(C)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_relat_1) ).
tff(c_68,plain,
relation('#skF_5'),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_72,plain,
( in(ordered_pair('#skF_7','#skF_8'),'#skF_5')
| ~ transitive('#skF_5') ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_167,plain,
~ transitive('#skF_5'),
inference(splitLeft,[status(thm)],[c_72]) ).
tff(c_30,plain,
! [A_13,B_27] :
( in(ordered_pair('#skF_1'(A_13,B_27),'#skF_2'(A_13,B_27)),A_13)
| is_transitive_in(A_13,B_27)
| ~ relation(A_13) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_1196,plain,
! [A_195,B_196] :
( in(ordered_pair('#skF_2'(A_195,B_196),'#skF_3'(A_195,B_196)),A_195)
| is_transitive_in(A_195,B_196)
| ~ relation(A_195) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_84,plain,
! [B_53,D_55,C_54] :
( transitive('#skF_5')
| in(ordered_pair(B_53,D_55),'#skF_5')
| ~ in(ordered_pair(C_54,D_55),'#skF_5')
| ~ in(ordered_pair(B_53,C_54),'#skF_5') ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_402,plain,
! [B_53,D_55,C_54] :
( in(ordered_pair(B_53,D_55),'#skF_5')
| ~ in(ordered_pair(C_54,D_55),'#skF_5')
| ~ in(ordered_pair(B_53,C_54),'#skF_5') ),
inference(negUnitSimplification,[status(thm)],[c_167,c_84]) ).
tff(c_1211,plain,
! [B_53,B_196] :
( in(ordered_pair(B_53,'#skF_3'('#skF_5',B_196)),'#skF_5')
| ~ in(ordered_pair(B_53,'#skF_2'('#skF_5',B_196)),'#skF_5')
| is_transitive_in('#skF_5',B_196)
| ~ relation('#skF_5') ),
inference(resolution,[status(thm)],[c_1196,c_402]) ).
tff(c_1319,plain,
! [B_211,B_212] :
( in(ordered_pair(B_211,'#skF_3'('#skF_5',B_212)),'#skF_5')
| ~ in(ordered_pair(B_211,'#skF_2'('#skF_5',B_212)),'#skF_5')
| is_transitive_in('#skF_5',B_212) ),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_1211]) ).
tff(c_26,plain,
! [A_13,B_27] :
( ~ in(ordered_pair('#skF_1'(A_13,B_27),'#skF_3'(A_13,B_27)),A_13)
| is_transitive_in(A_13,B_27)
| ~ relation(A_13) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_1325,plain,
! [B_212] :
( ~ relation('#skF_5')
| ~ in(ordered_pair('#skF_1'('#skF_5',B_212),'#skF_2'('#skF_5',B_212)),'#skF_5')
| is_transitive_in('#skF_5',B_212) ),
inference(resolution,[status(thm)],[c_1319,c_26]) ).
tff(c_1367,plain,
! [B_213] :
( ~ in(ordered_pair('#skF_1'('#skF_5',B_213),'#skF_2'('#skF_5',B_213)),'#skF_5')
| is_transitive_in('#skF_5',B_213) ),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_1325]) ).
tff(c_1371,plain,
! [B_27] :
( is_transitive_in('#skF_5',B_27)
| ~ relation('#skF_5') ),
inference(resolution,[status(thm)],[c_30,c_1367]) ).
tff(c_1383,plain,
! [B_214] : is_transitive_in('#skF_5',B_214),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_1371]) ).
tff(c_16,plain,
! [A_9] :
( transitive(A_9)
| ~ is_transitive_in(A_9,relation_field(A_9))
| ~ relation(A_9) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_1387,plain,
( transitive('#skF_5')
| ~ relation('#skF_5') ),
inference(resolution,[status(thm)],[c_1383,c_16]) ).
tff(c_1390,plain,
transitive('#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_1387]) ).
tff(c_1392,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_167,c_1390]) ).
tff(c_1394,plain,
transitive('#skF_5'),
inference(splitRight,[status(thm)],[c_72]) ).
tff(c_74,plain,
( in(ordered_pair('#skF_6','#skF_7'),'#skF_5')
| ~ transitive('#skF_5') ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_1554,plain,
in(ordered_pair('#skF_6','#skF_7'),'#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_1394,c_74]) ).
tff(c_2022,plain,
! [A_270,C_271,B_272] :
( in(A_270,relation_field(C_271))
| ~ in(ordered_pair(A_270,B_272),C_271)
| ~ relation(C_271) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_2029,plain,
( in('#skF_6',relation_field('#skF_5'))
| ~ relation('#skF_5') ),
inference(resolution,[status(thm)],[c_1554,c_2022]) ).
tff(c_2036,plain,
in('#skF_6',relation_field('#skF_5')),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_2029]) ).
tff(c_1970,plain,
! [B_267,C_268,A_269] :
( in(B_267,relation_field(C_268))
| ~ in(ordered_pair(A_269,B_267),C_268)
| ~ relation(C_268) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_1977,plain,
( in('#skF_7',relation_field('#skF_5'))
| ~ relation('#skF_5') ),
inference(resolution,[status(thm)],[c_1554,c_1970]) ).
tff(c_1984,plain,
in('#skF_7',relation_field('#skF_5')),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_1977]) ).
tff(c_1393,plain,
in(ordered_pair('#skF_7','#skF_8'),'#skF_5'),
inference(splitRight,[status(thm)],[c_72]) ).
tff(c_1980,plain,
( in('#skF_8',relation_field('#skF_5'))
| ~ relation('#skF_5') ),
inference(resolution,[status(thm)],[c_1393,c_1970]) ).
tff(c_1987,plain,
in('#skF_8',relation_field('#skF_5')),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_1980]) ).
tff(c_18,plain,
! [A_9] :
( is_transitive_in(A_9,relation_field(A_9))
| ~ transitive(A_9)
| ~ relation(A_9) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_70,plain,
( ~ in(ordered_pair('#skF_6','#skF_8'),'#skF_5')
| ~ transitive('#skF_5') ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_1433,plain,
~ in(ordered_pair('#skF_6','#skF_8'),'#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_1394,c_70]) ).
tff(c_2204,plain,
! [B_301,A_304,E_302,D_305,C_303] :
( in(ordered_pair(C_303,E_302),A_304)
| ~ in(ordered_pair(D_305,E_302),A_304)
| ~ in(ordered_pair(C_303,D_305),A_304)
| ~ in(E_302,B_301)
| ~ in(D_305,B_301)
| ~ in(C_303,B_301)
| ~ is_transitive_in(A_304,B_301)
| ~ relation(A_304) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_2215,plain,
! [C_303,B_301] :
( in(ordered_pair(C_303,'#skF_8'),'#skF_5')
| ~ in(ordered_pair(C_303,'#skF_7'),'#skF_5')
| ~ in('#skF_8',B_301)
| ~ in('#skF_7',B_301)
| ~ in(C_303,B_301)
| ~ is_transitive_in('#skF_5',B_301)
| ~ relation('#skF_5') ),
inference(resolution,[status(thm)],[c_1393,c_2204]) ).
tff(c_2257,plain,
! [C_310,B_311] :
( in(ordered_pair(C_310,'#skF_8'),'#skF_5')
| ~ in(ordered_pair(C_310,'#skF_7'),'#skF_5')
| ~ in('#skF_8',B_311)
| ~ in('#skF_7',B_311)
| ~ in(C_310,B_311)
| ~ is_transitive_in('#skF_5',B_311) ),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_2215]) ).
tff(c_2262,plain,
! [B_311] :
( in(ordered_pair('#skF_6','#skF_8'),'#skF_5')
| ~ in('#skF_8',B_311)
| ~ in('#skF_7',B_311)
| ~ in('#skF_6',B_311)
| ~ is_transitive_in('#skF_5',B_311) ),
inference(resolution,[status(thm)],[c_1554,c_2257]) ).
tff(c_2309,plain,
! [B_327] :
( ~ in('#skF_8',B_327)
| ~ in('#skF_7',B_327)
| ~ in('#skF_6',B_327)
| ~ is_transitive_in('#skF_5',B_327) ),
inference(negUnitSimplification,[status(thm)],[c_1433,c_2262]) ).
tff(c_2321,plain,
( ~ in('#skF_8',relation_field('#skF_5'))
| ~ in('#skF_7',relation_field('#skF_5'))
| ~ in('#skF_6',relation_field('#skF_5'))
| ~ transitive('#skF_5')
| ~ relation('#skF_5') ),
inference(resolution,[status(thm)],[c_18,c_2309]) ).
tff(c_2331,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_68,c_1394,c_2036,c_1984,c_1987,c_2321]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU240+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.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 12:00:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.83/2.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.83/2.39
% 5.83/2.39 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.83/2.42
% 5.83/2.42 Inference rules
% 5.83/2.42 ----------------------
% 5.83/2.42 #Ref : 0
% 5.83/2.42 #Sup : 529
% 5.83/2.42 #Fact : 0
% 5.83/2.42 #Define : 0
% 5.83/2.42 #Split : 7
% 5.83/2.42 #Chain : 0
% 5.83/2.42 #Close : 0
% 5.83/2.42
% 5.83/2.42 Ordering : KBO
% 5.83/2.42
% 5.83/2.42 Simplification rules
% 5.83/2.42 ----------------------
% 5.83/2.42 #Subsume : 74
% 5.83/2.42 #Demod : 168
% 5.83/2.42 #Tautology : 222
% 5.83/2.42 #SimpNegUnit : 26
% 5.83/2.42 #BackRed : 7
% 5.83/2.42
% 5.83/2.42 #Partial instantiations: 0
% 5.83/2.42 #Strategies tried : 1
% 5.83/2.42
% 5.83/2.42 Timing (in seconds)
% 5.83/2.42 ----------------------
% 5.83/2.42 Preprocessing : 0.54
% 5.83/2.42 Parsing : 0.29
% 5.83/2.42 CNF conversion : 0.05
% 5.83/2.42 Main loop : 0.79
% 5.83/2.42 Inferencing : 0.28
% 5.83/2.42 Reduction : 0.26
% 5.83/2.42 Demodulation : 0.19
% 5.83/2.42 BG Simplification : 0.04
% 5.83/2.42 Subsumption : 0.15
% 5.83/2.42 Abstraction : 0.03
% 5.83/2.42 MUC search : 0.00
% 5.83/2.42 Cooper : 0.00
% 5.83/2.42 Total : 1.38
% 5.83/2.42 Index Insertion : 0.00
% 5.83/2.42 Index Deletion : 0.00
% 5.83/2.42 Index Matching : 0.00
% 5.83/2.42 BG Taut test : 0.00
%------------------------------------------------------------------------------