TSTP Solution File: SWV411+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV411+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 : 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 11:04:02 EDT 2023
% Result : Theorem 3.57s 1.90s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 34 ( 10 unt; 17 typ; 0 def)
% Number of atoms : 30 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 8 ~; 7 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 11 >; 10 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 32 (; 30 !; 2 ?; 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_2 > #skF_5 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
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_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $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(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_121,axiom,
! [U,V,W,X,Y] :
( pair_in_list(insert_slb(U,pair(V,X)),W,Y)
<=> ( pair_in_list(U,W,Y)
| ( ( V = W )
& ( X = Y ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax23) ).
tff(f_167,negated_conjecture,
~ ! [U] :
( ! [V] :
( contains_slb(U,V)
=> ? [W] : pair_in_list(U,V,W) )
=> ! [X,Y,Z] :
( contains_slb(insert_slb(U,pair(Y,Z)),X)
=> ? [X1] : pair_in_list(insert_slb(U,pair(Y,Z)),X,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l47_co) ).
tff(f_110,axiom,
! [U,V,W,X] :
( contains_slb(insert_slb(U,pair(V,X)),W)
<=> ( contains_slb(U,W)
| ( V = W ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax21) ).
tff(c_34,plain,
! [U_20,W_22,Y_24] : pair_in_list(insert_slb(U_20,pair(W_22,Y_24)),W_22,Y_24),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_54,plain,
contains_slb(insert_slb('#skF_1',pair('#skF_4','#skF_5')),'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_250,plain,
! [W_106,V_107,U_108,X_109] :
( ( W_106 = V_107 )
| contains_slb(U_108,W_106)
| ~ contains_slb(insert_slb(U_108,pair(V_107,X_109)),W_106) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_263,plain,
( ( '#skF_3' = '#skF_4' )
| contains_slb('#skF_1','#skF_3') ),
inference(resolution,[status(thm)],[c_54,c_250]) ).
tff(c_264,plain,
contains_slb('#skF_1','#skF_3'),
inference(splitLeft,[status(thm)],[c_263]) ).
tff(c_56,plain,
! [V_56] :
( pair_in_list('#skF_1',V_56,'#skF_2'(V_56))
| ~ contains_slb('#skF_1',V_56) ),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_265,plain,
! [W_114,V_111,Y_112,X_113,U_110] :
( ~ pair_in_list(U_110,W_114,Y_112)
| pair_in_list(insert_slb(U_110,pair(V_111,X_113)),W_114,Y_112) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_52,plain,
! [X1_59] : ~ pair_in_list(insert_slb('#skF_1',pair('#skF_4','#skF_5')),'#skF_3',X1_59),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_271,plain,
! [Y_115] : ~ pair_in_list('#skF_1','#skF_3',Y_115),
inference(resolution,[status(thm)],[c_265,c_52]) ).
tff(c_275,plain,
~ contains_slb('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_56,c_271]) ).
tff(c_279,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_264,c_275]) ).
tff(c_280,plain,
'#skF_3' = '#skF_4',
inference(splitRight,[status(thm)],[c_263]) ).
tff(c_290,plain,
! [X1_116] : ~ pair_in_list(insert_slb('#skF_1',pair('#skF_4','#skF_5')),'#skF_4',X1_116),
inference(demodulation,[status(thm),theory(equality)],[c_280,c_52]) ).
tff(c_295,plain,
$false,
inference(resolution,[status(thm)],[c_34,c_290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV411+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/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.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 23:07:37 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.57/1.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.57/1.91
% 3.57/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.57/1.93
% 3.57/1.93 Inference rules
% 3.57/1.93 ----------------------
% 3.57/1.93 #Ref : 0
% 3.57/1.93 #Sup : 37
% 3.57/1.93 #Fact : 8
% 3.57/1.93 #Define : 0
% 3.57/1.93 #Split : 1
% 3.57/1.93 #Chain : 0
% 3.57/1.93 #Close : 0
% 3.57/1.93
% 3.57/1.93 Ordering : KBO
% 3.57/1.93
% 3.57/1.93 Simplification rules
% 3.57/1.93 ----------------------
% 3.57/1.93 #Subsume : 4
% 3.57/1.93 #Demod : 21
% 3.57/1.93 #Tautology : 29
% 3.57/1.93 #SimpNegUnit : 0
% 3.57/1.93 #BackRed : 2
% 3.57/1.93
% 3.57/1.93 #Partial instantiations: 0
% 3.57/1.93 #Strategies tried : 1
% 3.57/1.93
% 3.57/1.93 Timing (in seconds)
% 3.57/1.93 ----------------------
% 3.65/1.94 Preprocessing : 0.55
% 3.65/1.94 Parsing : 0.28
% 3.65/1.94 CNF conversion : 0.04
% 3.65/1.94 Main loop : 0.30
% 3.65/1.94 Inferencing : 0.10
% 3.65/1.94 Reduction : 0.08
% 3.65/1.94 Demodulation : 0.06
% 3.65/1.94 BG Simplification : 0.02
% 3.65/1.94 Subsumption : 0.07
% 3.65/1.94 Abstraction : 0.02
% 3.65/1.94 MUC search : 0.00
% 3.65/1.94 Cooper : 0.00
% 3.65/1.94 Total : 0.90
% 3.65/1.94 Index Insertion : 0.00
% 3.65/1.94 Index Deletion : 0.00
% 3.65/1.94 Index Matching : 0.00
% 3.65/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------