TSTP Solution File: SWV409+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV409+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 : n029.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 11:04:02 EDT 2023
% Result : Theorem 12.67s 4.01s
% Output : CNFRefutation 12.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 24
% Syntax : Number of formulae : 47 ( 8 unt; 17 typ; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 93 ( 42 ~; 38 |; 8 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 12 >; 14 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-4 aty)
% Number of variables : 52 (; 49 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > strictly_less_than > less_than > contains_slb > isnonempty_slb > update_slb > remove_slb > pair > lookup_slb > insert_slb > #nlpp > create_slb > bottom > #skF_5 > #skF_2 > #skF_3 > #skF_4 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(strictly_less_than,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(bottom,type,
bottom: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(isnonempty_slb,type,
isnonempty_slb: $i > $o ).
tff(remove_slb,type,
remove_slb: ( $i * $i ) > $i ).
tff(create_slb,type,
create_slb: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_191,negated_conjecture,
~ ! [U,V,W] :
( ( contains_slb(U,V)
& strictly_less_than(V,W) )
=> ( pair_in_list(update_slb(U,W),V,W)
| ? [X] :
( pair_in_list(update_slb(U,W),V,X)
& less_than(W,X) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l45_co) ).
tff(f_157,lemma,
! [U,V] :
( contains_slb(U,V)
=> ? [W] : pair_in_list(U,V,W) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l45_li4647) ).
tff(f_178,lemma,
! [U,V,W,X] :
( ( pair_in_list(U,V,W)
& strictly_less_than(V,X)
& less_than(X,W) )
=> ? [Y] :
( pair_in_list(update_slb(U,X),V,Y)
& less_than(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l45_l49) ).
tff(f_60,axiom,
! [U,V] :
( less_than(U,V)
| less_than(V,U) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
tff(f_62,axiom,
! [U] : less_than(U,U),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',reflexivity) ).
tff(f_69,axiom,
! [U,V] :
( strictly_less_than(U,V)
<=> ( less_than(U,V)
& ~ less_than(V,U) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
tff(f_166,lemma,
! [U,V,W,X] :
( ( pair_in_list(U,V,W)
& strictly_less_than(V,X)
& strictly_less_than(W,X) )
=> pair_in_list(update_slb(U,X),V,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l45_l48) ).
tff(c_66,plain,
contains_slb('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_52,plain,
! [U_48,V_49] :
( pair_in_list(U_48,V_49,'#skF_1'(U_48,V_49))
| ~ contains_slb(U_48,V_49) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_64,plain,
strictly_less_than('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_56,plain,
! [X_58,U_55,V_56,W_57] :
( less_than(X_58,'#skF_2'(U_55,V_56,W_57,X_58))
| ~ less_than(X_58,W_57)
| ~ strictly_less_than(V_56,X_58)
| ~ pair_in_list(U_55,V_56,W_57) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_2909,plain,
! [U_247,X_248,V_249,W_250] :
( pair_in_list(update_slb(U_247,X_248),V_249,'#skF_2'(U_247,V_249,W_250,X_248))
| ~ less_than(X_248,W_250)
| ~ strictly_less_than(V_249,X_248)
| ~ pair_in_list(U_247,V_249,W_250) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_60,plain,
! [X_61] :
( ~ less_than('#skF_5',X_61)
| ~ pair_in_list(update_slb('#skF_3','#skF_5'),'#skF_4',X_61) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_2913,plain,
! [W_250] :
( ~ less_than('#skF_5','#skF_2'('#skF_3','#skF_4',W_250,'#skF_5'))
| ~ less_than('#skF_5',W_250)
| ~ strictly_less_than('#skF_4','#skF_5')
| ~ pair_in_list('#skF_3','#skF_4',W_250) ),
inference(resolution,[status(thm)],[c_2909,c_60]) ).
tff(c_2930,plain,
! [W_251] :
( ~ less_than('#skF_5','#skF_2'('#skF_3','#skF_4',W_251,'#skF_5'))
| ~ less_than('#skF_5',W_251)
| ~ pair_in_list('#skF_3','#skF_4',W_251) ),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_2913]) ).
tff(c_2942,plain,
! [W_57] :
( ~ less_than('#skF_5',W_57)
| ~ strictly_less_than('#skF_4','#skF_5')
| ~ pair_in_list('#skF_3','#skF_4',W_57) ),
inference(resolution,[status(thm)],[c_56,c_2930]) ).
tff(c_2958,plain,
! [W_252] :
( ~ less_than('#skF_5',W_252)
| ~ pair_in_list('#skF_3','#skF_4',W_252) ),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_2942]) ).
tff(c_2962,plain,
( ~ less_than('#skF_5','#skF_1'('#skF_3','#skF_4'))
| ~ contains_slb('#skF_3','#skF_4') ),
inference(resolution,[status(thm)],[c_52,c_2958]) ).
tff(c_2965,plain,
~ less_than('#skF_5','#skF_1'('#skF_3','#skF_4')),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_2962]) ).
tff(c_4,plain,
! [V_5,U_4] :
( less_than(V_5,U_4)
| less_than(U_4,V_5) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_6,plain,
! [U_6] : less_than(U_6,U_6),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_8,plain,
! [U_7,V_8] :
( strictly_less_than(U_7,V_8)
| less_than(V_8,U_7)
| ~ less_than(U_7,V_8) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_1369,plain,
! [U_169,X_170,V_171,W_172] :
( pair_in_list(update_slb(U_169,X_170),V_171,X_170)
| ~ strictly_less_than(W_172,X_170)
| ~ strictly_less_than(V_171,X_170)
| ~ pair_in_list(U_169,V_171,W_172) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_4117,plain,
! [U_329,V_330,V_331,U_332] :
( pair_in_list(update_slb(U_329,V_330),V_331,V_330)
| ~ strictly_less_than(V_331,V_330)
| ~ pair_in_list(U_329,V_331,U_332)
| less_than(V_330,U_332)
| ~ less_than(U_332,V_330) ),
inference(resolution,[status(thm)],[c_8,c_1369]) ).
tff(c_13472,plain,
! [U_792,V_793,V_794] :
( pair_in_list(update_slb(U_792,V_793),V_794,V_793)
| ~ strictly_less_than(V_794,V_793)
| less_than(V_793,'#skF_1'(U_792,V_794))
| ~ less_than('#skF_1'(U_792,V_794),V_793)
| ~ contains_slb(U_792,V_794) ),
inference(resolution,[status(thm)],[c_52,c_4117]) ).
tff(c_13500,plain,
( ~ less_than('#skF_5','#skF_5')
| ~ strictly_less_than('#skF_4','#skF_5')
| less_than('#skF_5','#skF_1'('#skF_3','#skF_4'))
| ~ less_than('#skF_1'('#skF_3','#skF_4'),'#skF_5')
| ~ contains_slb('#skF_3','#skF_4') ),
inference(resolution,[status(thm)],[c_13472,c_60]) ).
tff(c_13557,plain,
( less_than('#skF_5','#skF_1'('#skF_3','#skF_4'))
| ~ less_than('#skF_1'('#skF_3','#skF_4'),'#skF_5') ),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_64,c_6,c_13500]) ).
tff(c_13558,plain,
~ less_than('#skF_1'('#skF_3','#skF_4'),'#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_2965,c_13557]) ).
tff(c_13669,plain,
less_than('#skF_5','#skF_1'('#skF_3','#skF_4')),
inference(resolution,[status(thm)],[c_4,c_13558]) ).
tff(c_13714,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2965,c_13669]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV409+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 : n029.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 22:47:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 12.67/4.01 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.67/4.01
% 12.67/4.01 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.89/4.04
% 12.89/4.04 Inference rules
% 12.89/4.04 ----------------------
% 12.89/4.04 #Ref : 0
% 12.89/4.04 #Sup : 3312
% 12.89/4.04 #Fact : 232
% 12.89/4.04 #Define : 0
% 12.89/4.04 #Split : 6
% 12.89/4.04 #Chain : 0
% 12.89/4.04 #Close : 0
% 12.89/4.04
% 12.89/4.04 Ordering : KBO
% 12.89/4.04
% 12.89/4.04 Simplification rules
% 12.89/4.04 ----------------------
% 12.89/4.04 #Subsume : 1713
% 12.89/4.04 #Demod : 643
% 12.89/4.04 #Tautology : 362
% 12.89/4.04 #SimpNegUnit : 33
% 12.89/4.04 #BackRed : 5
% 12.89/4.04
% 12.89/4.04 #Partial instantiations: 0
% 12.89/4.04 #Strategies tried : 1
% 12.89/4.04
% 12.89/4.04 Timing (in seconds)
% 12.89/4.04 ----------------------
% 12.89/4.04 Preprocessing : 0.52
% 12.89/4.04 Parsing : 0.27
% 12.89/4.04 CNF conversion : 0.03
% 12.89/4.04 Main loop : 2.52
% 12.89/4.04 Inferencing : 0.70
% 12.89/4.04 Reduction : 0.52
% 12.89/4.04 Demodulation : 0.36
% 12.89/4.04 BG Simplification : 0.08
% 12.89/4.04 Subsumption : 1.10
% 12.89/4.04 Abstraction : 0.08
% 12.89/4.04 MUC search : 0.00
% 12.89/4.04 Cooper : 0.00
% 12.89/4.04 Total : 3.09
% 12.89/4.04 Index Insertion : 0.00
% 12.89/4.04 Index Deletion : 0.00
% 12.89/4.04 Index Matching : 0.00
% 12.89/4.04 BG Taut test : 0.00
%------------------------------------------------------------------------------