TSTP Solution File: SEU193+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU193+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/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:58 EDT 2023
% Result : Theorem 11.06s 3.83s
% Output : CNFRefutation 11.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 31
% Syntax : Number of formulae : 50 ( 7 unt; 26 typ; 0 def)
% Number of atoms : 63 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 72 ( 33 ~; 27 |; 2 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 19 >; 16 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 7 con; 0-3 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation > empty > unordered_pair > relation_dom_restriction > ordered_pair > #nlpp > singleton > powerset > empty_set > #skF_9 > #skF_7 > #skF_6 > #skF_1 > #skF_11 > #skF_15 > #skF_4 > #skF_10 > #skF_14 > #skF_13 > #skF_2 > #skF_8 > #skF_3 > #skF_12 > #skF_5
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_15',type,
'#skF_15': $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_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(relation_dom_restriction,type,
relation_dom_restriction: ( $i * $i ) > $i ).
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(powerset,type,
powerset: $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff(f_160,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> subset(relation_dom_restriction(B,A),B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t88_relat_1) ).
tff(f_70,axiom,
! [A,B] :
( relation(A)
=> relation(relation_dom_restriction(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_relat_1) ).
tff(f_63,axiom,
! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> ( subset(A,B)
<=> ! [C,D] :
( in(ordered_pair(C,D),A)
=> in(ordered_pair(C,D),B) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_relat_1) ).
tff(f_155,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
tff(f_51,axiom,
! [A] :
( relation(A)
=> ! [B,C] :
( relation(C)
=> ( ( C = relation_dom_restriction(A,B) )
<=> ! [D,E] :
( in(ordered_pair(D,E),C)
<=> ( in(D,B)
& in(ordered_pair(D,E),A) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_relat_1) ).
tff(c_104,plain,
relation('#skF_15'),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_44,plain,
! [A_44,B_45] :
( relation(relation_dom_restriction(A_44,B_45))
| ~ relation(A_44) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_452,plain,
! [A_143,B_144] :
( in(ordered_pair('#skF_5'(A_143,B_144),'#skF_6'(A_143,B_144)),A_143)
| subset(A_143,B_144)
| ~ relation(B_144)
| ~ relation(A_143) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_100,plain,
! [B_74,A_73] :
( ~ empty(B_74)
| ~ in(A_73,B_74) ),
inference(cnfTransformation,[status(thm)],[f_155]) ).
tff(c_506,plain,
! [A_145,B_146] :
( ~ empty(A_145)
| subset(A_145,B_146)
| ~ relation(B_146)
| ~ relation(A_145) ),
inference(resolution,[status(thm)],[c_452,c_100]) ).
tff(c_102,plain,
~ subset(relation_dom_restriction('#skF_15','#skF_14'),'#skF_15'),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_509,plain,
( ~ empty(relation_dom_restriction('#skF_15','#skF_14'))
| ~ relation('#skF_15')
| ~ relation(relation_dom_restriction('#skF_15','#skF_14')) ),
inference(resolution,[status(thm)],[c_506,c_102]) ).
tff(c_512,plain,
( ~ empty(relation_dom_restriction('#skF_15','#skF_14'))
| ~ relation(relation_dom_restriction('#skF_15','#skF_14')) ),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_509]) ).
tff(c_513,plain,
~ relation(relation_dom_restriction('#skF_15','#skF_14')),
inference(splitLeft,[status(thm)],[c_512]) ).
tff(c_516,plain,
~ relation('#skF_15'),
inference(resolution,[status(thm)],[c_44,c_513]) ).
tff(c_523,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_104,c_516]) ).
tff(c_525,plain,
relation(relation_dom_restriction('#skF_15','#skF_14')),
inference(splitRight,[status(thm)],[c_512]) ).
tff(c_30,plain,
! [A_25,B_35] :
( in(ordered_pair('#skF_5'(A_25,B_35),'#skF_6'(A_25,B_35)),A_25)
| subset(A_25,B_35)
| ~ relation(B_35)
| ~ relation(A_25) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_647,plain,
! [D_164,E_165,A_166,B_167] :
( in(ordered_pair(D_164,E_165),A_166)
| ~ in(ordered_pair(D_164,E_165),relation_dom_restriction(A_166,B_167))
| ~ relation(relation_dom_restriction(A_166,B_167))
| ~ relation(A_166) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_16007,plain,
! [A_619,B_620,B_621] :
( in(ordered_pair('#skF_5'(relation_dom_restriction(A_619,B_620),B_621),'#skF_6'(relation_dom_restriction(A_619,B_620),B_621)),A_619)
| ~ relation(A_619)
| subset(relation_dom_restriction(A_619,B_620),B_621)
| ~ relation(B_621)
| ~ relation(relation_dom_restriction(A_619,B_620)) ),
inference(resolution,[status(thm)],[c_30,c_647]) ).
tff(c_28,plain,
! [A_25,B_35] :
( ~ in(ordered_pair('#skF_5'(A_25,B_35),'#skF_6'(A_25,B_35)),B_35)
| subset(A_25,B_35)
| ~ relation(B_35)
| ~ relation(A_25) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_16270,plain,
! [A_622,B_623] :
( subset(relation_dom_restriction(A_622,B_623),A_622)
| ~ relation(A_622)
| ~ relation(relation_dom_restriction(A_622,B_623)) ),
inference(resolution,[status(thm)],[c_16007,c_28]) ).
tff(c_16290,plain,
( ~ relation('#skF_15')
| ~ relation(relation_dom_restriction('#skF_15','#skF_14')) ),
inference(resolution,[status(thm)],[c_16270,c_102]) ).
tff(c_16373,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_525,c_104,c_16290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU193+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % 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 12:01:07 EDT 2023
% 0.15/0.37 % CPUTime :
% 11.06/3.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.86/3.84
% 11.86/3.84 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.86/3.86
% 11.86/3.86 Inference rules
% 11.86/3.86 ----------------------
% 11.86/3.86 #Ref : 0
% 11.86/3.86 #Sup : 4037
% 11.86/3.86 #Fact : 0
% 11.86/3.86 #Define : 0
% 11.86/3.86 #Split : 23
% 11.86/3.86 #Chain : 0
% 11.86/3.86 #Close : 0
% 11.86/3.86
% 11.86/3.86 Ordering : KBO
% 11.86/3.86
% 11.86/3.86 Simplification rules
% 11.86/3.86 ----------------------
% 11.86/3.86 #Subsume : 1821
% 11.86/3.86 #Demod : 2062
% 11.86/3.86 #Tautology : 1080
% 11.86/3.86 #SimpNegUnit : 248
% 11.86/3.86 #BackRed : 119
% 11.86/3.86
% 11.86/3.86 #Partial instantiations: 0
% 11.86/3.86 #Strategies tried : 1
% 11.86/3.86
% 11.86/3.86 Timing (in seconds)
% 11.86/3.86 ----------------------
% 11.86/3.87 Preprocessing : 0.56
% 11.86/3.87 Parsing : 0.29
% 11.86/3.87 CNF conversion : 0.05
% 11.86/3.87 Main loop : 2.22
% 11.86/3.87 Inferencing : 0.66
% 11.86/3.87 Reduction : 0.78
% 11.86/3.87 Demodulation : 0.59
% 11.86/3.87 BG Simplification : 0.06
% 11.86/3.87 Subsumption : 0.57
% 11.86/3.87 Abstraction : 0.08
% 11.86/3.87 MUC search : 0.00
% 11.86/3.87 Cooper : 0.00
% 11.86/3.87 Total : 2.83
% 11.86/3.87 Index Insertion : 0.00
% 11.86/3.87 Index Deletion : 0.00
% 11.86/3.87 Index Matching : 0.00
% 11.86/3.87 BG Taut test : 0.00
%------------------------------------------------------------------------------