TSTP Solution File: SEU355+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU355+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 : n016.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:30 EDT 2023
% Result : Theorem 3.28s 1.88s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 49 ( 11 unt; 21 typ; 0 def)
% Number of atoms : 65 ( 3 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 66 ( 29 ~; 22 |; 2 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 13 >; 12 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 33 (; 32 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ relstr_set_smaller > relstr_element_smaller > related > in > element > rel_str > one_sorted_str > finite > empty > #nlpp > the_carrier > empty_set > #skF_5 > #skF_1 > #skF_7 > #skF_10 > #skF_6 > #skF_3 > #skF_2 > #skF_9 > #skF_8 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(related,type,
related: ( $i * $i * $i ) > $o ).
tff(the_carrier,type,
the_carrier: $i > $i ).
tff(relstr_set_smaller,type,
relstr_set_smaller: ( $i * $i * $i ) > $o ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(finite,type,
finite: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(one_sorted_str,type,
one_sorted_str: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(rel_str,type,
rel_str: $i > $o ).
tff(relstr_element_smaller,type,
relstr_element_smaller: ( $i * $i * $i ) > $o ).
tff(f_83,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_110,negated_conjecture,
~ ! [A] :
( rel_str(A)
=> ! [B] :
( element(B,the_carrier(A))
=> ( relstr_set_smaller(A,empty_set,B)
& relstr_element_smaller(A,empty_set,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_yellow_0) ).
tff(f_49,axiom,
! [A] :
( rel_str(A)
=> ! [B,C] :
( element(C,the_carrier(A))
=> ( relstr_element_smaller(A,B,C)
<=> ! [D] :
( element(D,the_carrier(A))
=> ( in(D,B)
=> related(A,C,D) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_lattice3) ).
tff(f_115,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
tff(f_63,axiom,
! [A] :
( rel_str(A)
=> ! [B,C] :
( element(C,the_carrier(A))
=> ( relstr_set_smaller(A,B,C)
<=> ! [D] :
( element(D,the_carrier(A))
=> ( in(D,B)
=> related(A,D,C) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_lattice3) ).
tff(f_100,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(c_44,plain,
empty('#skF_7'),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_58,plain,
rel_str('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_56,plain,
element('#skF_10',the_carrier('#skF_9')),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_233,plain,
! [A_91,B_92,C_93] :
( in('#skF_1'(A_91,B_92,C_93),B_92)
| relstr_element_smaller(A_91,B_92,C_93)
| ~ element(C_93,the_carrier(A_91))
| ~ rel_str(A_91) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_60,plain,
! [B_38,A_37] :
( ~ empty(B_38)
| ~ in(A_37,B_38) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_250,plain,
! [B_94,A_95,C_96] :
( ~ empty(B_94)
| relstr_element_smaller(A_95,B_94,C_96)
| ~ element(C_96,the_carrier(A_95))
| ~ rel_str(A_95) ),
inference(resolution,[status(thm)],[c_233,c_60]) ).
tff(c_255,plain,
! [B_94] :
( ~ empty(B_94)
| relstr_element_smaller('#skF_9',B_94,'#skF_10')
| ~ rel_str('#skF_9') ),
inference(resolution,[status(thm)],[c_56,c_250]) ).
tff(c_260,plain,
! [B_97] :
( ~ empty(B_97)
| relstr_element_smaller('#skF_9',B_97,'#skF_10') ),
inference(demodulation,[status(thm),theory(equality)],[c_58,c_255]) ).
tff(c_160,plain,
! [A_70,B_71,C_72] :
( in('#skF_2'(A_70,B_71,C_72),B_71)
| relstr_set_smaller(A_70,B_71,C_72)
| ~ element(C_72,the_carrier(A_70))
| ~ rel_str(A_70) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_176,plain,
! [B_73,A_74,C_75] :
( ~ empty(B_73)
| relstr_set_smaller(A_74,B_73,C_75)
| ~ element(C_75,the_carrier(A_74))
| ~ rel_str(A_74) ),
inference(resolution,[status(thm)],[c_160,c_60]) ).
tff(c_181,plain,
! [B_73] :
( ~ empty(B_73)
| relstr_set_smaller('#skF_9',B_73,'#skF_10')
| ~ rel_str('#skF_9') ),
inference(resolution,[status(thm)],[c_56,c_176]) ).
tff(c_196,plain,
! [B_79] :
( ~ empty(B_79)
| relstr_set_smaller('#skF_9',B_79,'#skF_10') ),
inference(demodulation,[status(thm),theory(equality)],[c_58,c_181]) ).
tff(c_63,plain,
! [A_41] :
( ( empty_set = A_41 )
| ~ empty(A_41) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_72,plain,
empty_set = '#skF_7',
inference(resolution,[status(thm)],[c_44,c_63]) ).
tff(c_54,plain,
( ~ relstr_element_smaller('#skF_9',empty_set,'#skF_10')
| ~ relstr_set_smaller('#skF_9',empty_set,'#skF_10') ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_102,plain,
( ~ relstr_element_smaller('#skF_9','#skF_7','#skF_10')
| ~ relstr_set_smaller('#skF_9','#skF_7','#skF_10') ),
inference(demodulation,[status(thm),theory(equality)],[c_72,c_72,c_54]) ).
tff(c_103,plain,
~ relstr_set_smaller('#skF_9','#skF_7','#skF_10'),
inference(splitLeft,[status(thm)],[c_102]) ).
tff(c_199,plain,
~ empty('#skF_7'),
inference(resolution,[status(thm)],[c_196,c_103]) ).
tff(c_203,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_44,c_199]) ).
tff(c_204,plain,
~ relstr_element_smaller('#skF_9','#skF_7','#skF_10'),
inference(splitRight,[status(thm)],[c_102]) ).
tff(c_263,plain,
~ empty('#skF_7'),
inference(resolution,[status(thm)],[c_260,c_204]) ).
tff(c_267,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_44,c_263]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU355+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/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.14/0.36 % Computer : n016.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:13:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.28/1.88 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.28/1.89
% 3.28/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.56/1.91
% 3.56/1.91 Inference rules
% 3.56/1.91 ----------------------
% 3.56/1.91 #Ref : 0
% 3.56/1.91 #Sup : 43
% 3.56/1.91 #Fact : 0
% 3.56/1.91 #Define : 0
% 3.56/1.91 #Split : 3
% 3.56/1.91 #Chain : 0
% 3.56/1.91 #Close : 0
% 3.56/1.91
% 3.56/1.91 Ordering : KBO
% 3.56/1.91
% 3.56/1.91 Simplification rules
% 3.56/1.91 ----------------------
% 3.56/1.91 #Subsume : 1
% 3.56/1.91 #Demod : 10
% 3.56/1.91 #Tautology : 13
% 3.56/1.91 #SimpNegUnit : 0
% 3.56/1.91 #BackRed : 2
% 3.56/1.91
% 3.56/1.91 #Partial instantiations: 0
% 3.56/1.91 #Strategies tried : 1
% 3.56/1.91
% 3.56/1.91 Timing (in seconds)
% 3.56/1.91 ----------------------
% 3.56/1.92 Preprocessing : 0.50
% 3.56/1.92 Parsing : 0.27
% 3.56/1.92 CNF conversion : 0.04
% 3.56/1.92 Main loop : 0.34
% 3.56/1.92 Inferencing : 0.14
% 3.56/1.92 Reduction : 0.08
% 3.56/1.92 Demodulation : 0.06
% 3.56/1.92 BG Simplification : 0.02
% 3.56/1.92 Subsumption : 0.07
% 3.56/1.92 Abstraction : 0.01
% 3.56/1.92 MUC search : 0.00
% 3.56/1.92 Cooper : 0.00
% 3.56/1.92 Total : 0.88
% 3.56/1.92 Index Insertion : 0.00
% 3.56/1.92 Index Deletion : 0.00
% 3.56/1.92 Index Matching : 0.00
% 3.56/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------