TSTP Solution File: SEU204+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU204+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 : n032.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:00 EDT 2023
% Result : Theorem 48.80s 36.18s
% Output : CNFRefutation 48.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 34
% Syntax : Number of formulae : 45 ( 4 unt; 30 typ; 0 def)
% Number of atoms : 36 ( 2 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 33 ( 12 ~; 11 |; 1 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 44 ( 23 >; 21 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 7 con; 0-4 aty)
% Number of variables : 32 (; 30 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation > empty > unordered_pair > relation_image > ordered_pair > #nlpp > singleton > relation_rng > powerset > empty_set > #skF_6 > #skF_1 > #skF_18 > #skF_17 > #skF_11 > #skF_16 > #skF_15 > #skF_14 > #skF_10 > #skF_13 > #skF_2 > #skF_8 > #skF_9 > #skF_4 > #skF_3 > #skF_12 > #skF_7 > #skF_5
%Foreground sorts:
%Background operators:
%Foreground operators:
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('#skF_18',type,
'#skF_18': $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_17',type,
'#skF_17': $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('#skF_16',type,
'#skF_16': $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_10',type,
'#skF_10': $i > $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(relation_image,type,
relation_image: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff(f_139,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> subset(relation_image(B,A),relation_rng(B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t144_relat_1) ).
tff(f_57,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_50,axiom,
! [A] :
( relation(A)
=> ! [B,C] :
( ( C = relation_image(A,B) )
<=> ! [D] :
( in(D,C)
<=> ? [E] :
( in(ordered_pair(E,D),A)
& in(E,B) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d13_relat_1) ).
tff(f_68,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_rng(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(D,C),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_relat_1) ).
tff(c_108,plain,
relation('#skF_18'),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_30,plain,
! [A_48,B_49] :
( in('#skF_5'(A_48,B_49),A_48)
| subset(A_48,B_49) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_1029,plain,
! [A_262,B_263,D_264] :
( in(ordered_pair('#skF_4'(A_262,B_263,relation_image(A_262,B_263),D_264),D_264),A_262)
| ~ in(D_264,relation_image(A_262,B_263))
| ~ relation(A_262) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_34,plain,
! [C_89,A_53,D_92] :
( in(C_89,relation_rng(A_53))
| ~ in(ordered_pair(D_92,C_89),A_53)
| ~ relation(A_53) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_2675,plain,
! [D_349,A_350,B_351] :
( in(D_349,relation_rng(A_350))
| ~ in(D_349,relation_image(A_350,B_351))
| ~ relation(A_350) ),
inference(resolution,[status(thm)],[c_1029,c_34]) ).
tff(c_260569,plain,
! [A_2161,B_2162,B_2163] :
( in('#skF_5'(relation_image(A_2161,B_2162),B_2163),relation_rng(A_2161))
| ~ relation(A_2161)
| subset(relation_image(A_2161,B_2162),B_2163) ),
inference(resolution,[status(thm)],[c_30,c_2675]) ).
tff(c_28,plain,
! [A_48,B_49] :
( ~ in('#skF_5'(A_48,B_49),B_49)
| subset(A_48,B_49) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_261137,plain,
! [A_2164,B_2165] :
( ~ relation(A_2164)
| subset(relation_image(A_2164,B_2165),relation_rng(A_2164)) ),
inference(resolution,[status(thm)],[c_260569,c_28]) ).
tff(c_106,plain,
~ subset(relation_image('#skF_18','#skF_17'),relation_rng('#skF_18')),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_261235,plain,
~ relation('#skF_18'),
inference(resolution,[status(thm)],[c_261137,c_106]) ).
tff(c_261712,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_108,c_261235]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU204+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % 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.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu Aug 3 11:40:21 EDT 2023
% 0.10/0.30 % CPUTime :
% 48.80/36.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 48.80/36.19
% 48.80/36.19 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 48.80/36.21
% 48.80/36.21 Inference rules
% 48.80/36.21 ----------------------
% 48.80/36.21 #Ref : 0
% 48.80/36.21 #Sup : 70311
% 48.80/36.21 #Fact : 0
% 48.80/36.21 #Define : 0
% 48.80/36.21 #Split : 64
% 48.80/36.21 #Chain : 0
% 48.80/36.21 #Close : 0
% 48.80/36.21
% 48.80/36.21 Ordering : KBO
% 48.80/36.21
% 48.80/36.21 Simplification rules
% 48.80/36.21 ----------------------
% 48.80/36.21 #Subsume : 31337
% 48.80/36.21 #Demod : 38704
% 48.80/36.21 #Tautology : 19427
% 48.80/36.21 #SimpNegUnit : 2400
% 48.80/36.21 #BackRed : 1029
% 48.80/36.21
% 48.80/36.21 #Partial instantiations: 0
% 48.80/36.21 #Strategies tried : 1
% 48.80/36.21
% 48.80/36.21 Timing (in seconds)
% 48.80/36.21 ----------------------
% 48.80/36.21 Preprocessing : 0.57
% 48.80/36.21 Parsing : 0.29
% 48.80/36.21 CNF conversion : 0.05
% 48.80/36.21 Main loop : 34.76
% 48.80/36.21 Inferencing : 3.56
% 48.80/36.21 Reduction : 8.39
% 48.80/36.21 Demodulation : 5.85
% 48.80/36.21 BG Simplification : 0.30
% 48.80/36.21 Subsumption : 19.85
% 48.80/36.21 Abstraction : 0.44
% 48.80/36.21 MUC search : 0.00
% 48.80/36.21 Cooper : 0.00
% 48.80/36.21 Total : 35.37
% 48.80/36.22 Index Insertion : 0.00
% 48.80/36.22 Index Deletion : 0.00
% 48.80/36.22 Index Matching : 0.00
% 48.80/36.22 BG Taut test : 0.00
%------------------------------------------------------------------------------