TSTP Solution File: SEU239+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU239+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 : 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:58:08 EDT 2023
% Result : Theorem 5.06s 2.34s
% Output : CNFRefutation 5.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 28
% Syntax : Number of formulae : 55 ( 12 unt; 25 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 61 ( 28 ~; 25 |; 0 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 17 >; 7 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_reflexive_in > in > element > relation > reflexive > one_to_one > function > empty > unordered_pair > set_union2 > ordered_pair > #nlpp > singleton > relation_rng > relation_field > relation_dom > empty_set > #skF_2 > #skF_7 > #skF_5 > #skF_6 > #skF_3 > #skF_9 > #skF_8 > #skF_4 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation_field,type,
relation_field: $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(is_reflexive_in,type,
is_reflexive_in: ( $i * $i ) > $o ).
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(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_3',type,
'#skF_3': $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_4',type,
'#skF_4': $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(reflexive,type,
reflexive: $i > $o ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_105,negated_conjecture,
~ ! [A] :
( relation(A)
=> ( reflexive(A)
<=> ! [B] :
( in(B,relation_field(A))
=> in(ordered_pair(B,B),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_wellord1) ).
tff(f_61,axiom,
! [A] :
( relation(A)
=> ! [B] :
( is_reflexive_in(A,B)
<=> ! [C] :
( in(C,B)
=> in(ordered_pair(C,C),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_2) ).
tff(f_73,axiom,
! [A] :
( relation(A)
=> ( reflexive(A)
<=> is_reflexive_in(A,relation_field(A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_relat_2) ).
tff(c_64,plain,
( in('#skF_4',relation_field('#skF_3'))
| ~ reflexive('#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_105,plain,
~ reflexive('#skF_3'),
inference(splitLeft,[status(thm)],[c_64]) ).
tff(c_60,plain,
relation('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_20,plain,
! [A_9,B_15] :
( in('#skF_1'(A_9,B_15),B_15)
| is_reflexive_in(A_9,B_15)
| ~ relation(A_9) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_72,plain,
! [B_35] :
( reflexive('#skF_3')
| in(ordered_pair(B_35,B_35),'#skF_3')
| ~ in(B_35,relation_field('#skF_3')) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_188,plain,
! [B_35] :
( in(ordered_pair(B_35,B_35),'#skF_3')
| ~ in(B_35,relation_field('#skF_3')) ),
inference(negUnitSimplification,[status(thm)],[c_105,c_72]) ).
tff(c_725,plain,
! [A_114,B_115] :
( ~ in(ordered_pair('#skF_1'(A_114,B_115),'#skF_1'(A_114,B_115)),A_114)
| is_reflexive_in(A_114,B_115)
| ~ relation(A_114) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_733,plain,
! [B_115] :
( is_reflexive_in('#skF_3',B_115)
| ~ relation('#skF_3')
| ~ in('#skF_1'('#skF_3',B_115),relation_field('#skF_3')) ),
inference(resolution,[status(thm)],[c_188,c_725]) ).
tff(c_738,plain,
! [B_116] :
( is_reflexive_in('#skF_3',B_116)
| ~ in('#skF_1'('#skF_3',B_116),relation_field('#skF_3')) ),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_733]) ).
tff(c_742,plain,
( is_reflexive_in('#skF_3',relation_field('#skF_3'))
| ~ relation('#skF_3') ),
inference(resolution,[status(thm)],[c_20,c_738]) ).
tff(c_748,plain,
is_reflexive_in('#skF_3',relation_field('#skF_3')),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_742]) ).
tff(c_26,plain,
! [A_22] :
( reflexive(A_22)
| ~ is_reflexive_in(A_22,relation_field(A_22))
| ~ relation(A_22) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_752,plain,
( reflexive('#skF_3')
| ~ relation('#skF_3') ),
inference(resolution,[status(thm)],[c_748,c_26]) ).
tff(c_755,plain,
reflexive('#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_752]) ).
tff(c_757,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_105,c_755]) ).
tff(c_759,plain,
reflexive('#skF_3'),
inference(splitRight,[status(thm)],[c_64]) ).
tff(c_62,plain,
( ~ in(ordered_pair('#skF_4','#skF_4'),'#skF_3')
| ~ reflexive('#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_760,plain,
~ reflexive('#skF_3'),
inference(splitLeft,[status(thm)],[c_62]) ).
tff(c_762,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_759,c_760]) ).
tff(c_763,plain,
~ in(ordered_pair('#skF_4','#skF_4'),'#skF_3'),
inference(splitRight,[status(thm)],[c_62]) ).
tff(c_28,plain,
! [A_22] :
( is_reflexive_in(A_22,relation_field(A_22))
| ~ reflexive(A_22)
| ~ relation(A_22) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_758,plain,
in('#skF_4',relation_field('#skF_3')),
inference(splitRight,[status(thm)],[c_64]) ).
tff(c_1265,plain,
! [C_165,A_166,B_167] :
( in(ordered_pair(C_165,C_165),A_166)
| ~ in(C_165,B_167)
| ~ is_reflexive_in(A_166,B_167)
| ~ relation(A_166) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_1278,plain,
! [A_168] :
( in(ordered_pair('#skF_4','#skF_4'),A_168)
| ~ is_reflexive_in(A_168,relation_field('#skF_3'))
| ~ relation(A_168) ),
inference(resolution,[status(thm)],[c_758,c_1265]) ).
tff(c_1286,plain,
( in(ordered_pair('#skF_4','#skF_4'),'#skF_3')
| ~ reflexive('#skF_3')
| ~ relation('#skF_3') ),
inference(resolution,[status(thm)],[c_28,c_1278]) ).
tff(c_1290,plain,
in(ordered_pair('#skF_4','#skF_4'),'#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_759,c_1286]) ).
tff(c_1292,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_763,c_1290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU239+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 : n020.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 13:21:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.06/2.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.06/2.34
% 5.06/2.34 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.15/2.37
% 5.15/2.37 Inference rules
% 5.15/2.37 ----------------------
% 5.15/2.37 #Ref : 0
% 5.15/2.37 #Sup : 276
% 5.15/2.37 #Fact : 0
% 5.15/2.37 #Define : 0
% 5.15/2.37 #Split : 7
% 5.15/2.37 #Chain : 0
% 5.15/2.37 #Close : 0
% 5.15/2.37
% 5.15/2.37 Ordering : KBO
% 5.15/2.37
% 5.15/2.37 Simplification rules
% 5.15/2.37 ----------------------
% 5.15/2.37 #Subsume : 19
% 5.15/2.37 #Demod : 73
% 5.15/2.37 #Tautology : 169
% 5.15/2.37 #SimpNegUnit : 7
% 5.15/2.37 #BackRed : 12
% 5.15/2.37
% 5.15/2.37 #Partial instantiations: 0
% 5.15/2.37 #Strategies tried : 1
% 5.15/2.37
% 5.15/2.37 Timing (in seconds)
% 5.15/2.37 ----------------------
% 5.15/2.37 Preprocessing : 0.59
% 5.15/2.38 Parsing : 0.31
% 5.15/2.38 CNF conversion : 0.05
% 5.15/2.38 Main loop : 0.63
% 5.15/2.38 Inferencing : 0.23
% 5.15/2.38 Reduction : 0.19
% 5.15/2.38 Demodulation : 0.14
% 5.15/2.38 BG Simplification : 0.03
% 5.15/2.38 Subsumption : 0.12
% 5.15/2.38 Abstraction : 0.02
% 5.15/2.38 MUC search : 0.00
% 5.15/2.38 Cooper : 0.00
% 5.15/2.38 Total : 1.27
% 5.15/2.38 Index Insertion : 0.00
% 5.15/2.38 Index Deletion : 0.00
% 5.15/2.38 Index Matching : 0.00
% 5.15/2.38 BG Taut test : 0.00
%------------------------------------------------------------------------------