TSTP Solution File: SEU199+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU199+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:59 EDT 2023
% Result : Theorem 11.78s 3.80s
% Output : CNFRefutation 11.78s
% 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_rng_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(relation_rng_restriction,type,
relation_rng_restriction: ( $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(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_124,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> subset(relation_rng_restriction(A,B),B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t117_relat_1) ).
tff(f_70,axiom,
! [A,B] :
( relation(B)
=> relation(relation_rng_restriction(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k8_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_160,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
tff(f_51,axiom,
! [A,B] :
( relation(B)
=> ! [C] :
( relation(C)
=> ( ( C = relation_rng_restriction(A,B) )
<=> ! [D,E] :
( in(ordered_pair(D,E),C)
<=> ( in(E,A)
& in(ordered_pair(D,E),B) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_relat_1) ).
tff(c_88,plain,
relation('#skF_15'),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_44,plain,
! [A_43,B_44] :
( relation(relation_rng_restriction(A_43,B_44))
| ~ relation(B_44) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_439,plain,
! [A_135,B_136] :
( in(ordered_pair('#skF_5'(A_135,B_136),'#skF_6'(A_135,B_136)),A_135)
| subset(A_135,B_136)
| ~ relation(B_136)
| ~ relation(A_135) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_104,plain,
! [B_73,A_72] :
( ~ empty(B_73)
| ~ in(A_72,B_73) ),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_484,plain,
! [A_140,B_141] :
( ~ empty(A_140)
| subset(A_140,B_141)
| ~ relation(B_141)
| ~ relation(A_140) ),
inference(resolution,[status(thm)],[c_439,c_104]) ).
tff(c_86,plain,
~ subset(relation_rng_restriction('#skF_14','#skF_15'),'#skF_15'),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_487,plain,
( ~ empty(relation_rng_restriction('#skF_14','#skF_15'))
| ~ relation('#skF_15')
| ~ relation(relation_rng_restriction('#skF_14','#skF_15')) ),
inference(resolution,[status(thm)],[c_484,c_86]) ).
tff(c_490,plain,
( ~ empty(relation_rng_restriction('#skF_14','#skF_15'))
| ~ relation(relation_rng_restriction('#skF_14','#skF_15')) ),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_487]) ).
tff(c_491,plain,
~ relation(relation_rng_restriction('#skF_14','#skF_15')),
inference(splitLeft,[status(thm)],[c_490]) ).
tff(c_494,plain,
~ relation('#skF_15'),
inference(resolution,[status(thm)],[c_44,c_491]) ).
tff(c_501,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_494]) ).
tff(c_503,plain,
relation(relation_rng_restriction('#skF_14','#skF_15')),
inference(splitRight,[status(thm)],[c_490]) ).
tff(c_30,plain,
! [A_24,B_34] :
( in(ordered_pair('#skF_5'(A_24,B_34),'#skF_6'(A_24,B_34)),A_24)
| subset(A_24,B_34)
| ~ relation(B_34)
| ~ relation(A_24) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_664,plain,
! [D_168,E_169,B_170,A_171] :
( in(ordered_pair(D_168,E_169),B_170)
| ~ in(ordered_pair(D_168,E_169),relation_rng_restriction(A_171,B_170))
| ~ relation(relation_rng_restriction(A_171,B_170))
| ~ relation(B_170) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_14618,plain,
! [A_595,B_596,B_597] :
( in(ordered_pair('#skF_5'(relation_rng_restriction(A_595,B_596),B_597),'#skF_6'(relation_rng_restriction(A_595,B_596),B_597)),B_596)
| ~ relation(B_596)
| subset(relation_rng_restriction(A_595,B_596),B_597)
| ~ relation(B_597)
| ~ relation(relation_rng_restriction(A_595,B_596)) ),
inference(resolution,[status(thm)],[c_30,c_664]) ).
tff(c_28,plain,
! [A_24,B_34] :
( ~ in(ordered_pair('#skF_5'(A_24,B_34),'#skF_6'(A_24,B_34)),B_34)
| subset(A_24,B_34)
| ~ relation(B_34)
| ~ relation(A_24) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_14875,plain,
! [A_598,B_599] :
( subset(relation_rng_restriction(A_598,B_599),B_599)
| ~ relation(B_599)
| ~ relation(relation_rng_restriction(A_598,B_599)) ),
inference(resolution,[status(thm)],[c_14618,c_28]) ).
tff(c_14895,plain,
( ~ relation('#skF_15')
| ~ relation(relation_rng_restriction('#skF_14','#skF_15')) ),
inference(resolution,[status(thm)],[c_14875,c_86]) ).
tff(c_14975,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_503,c_88,c_14895]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU199+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 11:28:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 11.78/3.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.78/3.81
% 11.78/3.81 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.78/3.84
% 11.78/3.84 Inference rules
% 11.78/3.84 ----------------------
% 11.78/3.84 #Ref : 0
% 11.78/3.84 #Sup : 3692
% 11.78/3.84 #Fact : 0
% 11.78/3.84 #Define : 0
% 11.78/3.84 #Split : 23
% 11.78/3.84 #Chain : 0
% 11.78/3.84 #Close : 0
% 11.78/3.84
% 11.78/3.84 Ordering : KBO
% 11.78/3.84
% 11.78/3.84 Simplification rules
% 11.78/3.84 ----------------------
% 11.78/3.84 #Subsume : 1644
% 11.78/3.84 #Demod : 1956
% 11.78/3.84 #Tautology : 1012
% 11.78/3.84 #SimpNegUnit : 245
% 11.78/3.84 #BackRed : 121
% 11.78/3.84
% 11.78/3.84 #Partial instantiations: 0
% 11.78/3.84 #Strategies tried : 1
% 11.78/3.84
% 11.78/3.84 Timing (in seconds)
% 11.78/3.84 ----------------------
% 11.78/3.84 Preprocessing : 0.57
% 11.78/3.84 Parsing : 0.29
% 11.78/3.84 CNF conversion : 0.05
% 11.78/3.84 Main loop : 2.20
% 11.78/3.84 Inferencing : 0.65
% 11.78/3.84 Reduction : 0.76
% 11.78/3.84 Demodulation : 0.57
% 11.78/3.84 BG Simplification : 0.06
% 11.78/3.84 Subsumption : 0.57
% 11.78/3.84 Abstraction : 0.08
% 11.78/3.84 MUC search : 0.00
% 11.78/3.84 Cooper : 0.00
% 11.78/3.84 Total : 2.82
% 11.78/3.84 Index Insertion : 0.00
% 11.78/3.84 Index Deletion : 0.00
% 11.78/3.84 Index Matching : 0.00
% 11.78/3.84 BG Taut test : 0.00
%------------------------------------------------------------------------------