TSTP Solution File: SWV416+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV416+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 : n011.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:03 EDT 2023
% Result : Theorem 8.94s 3.09s
% Output : CNFRefutation 8.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 58
% Syntax : Number of formulae : 75 ( 14 unt; 53 typ; 0 def)
% Number of atoms : 32 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 4 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 76 ( 45 >; 31 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 34 ( 34 usr; 8 con; 0-3 aty)
% Number of variables : 40 (; 40 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > pi_sharp_removemin > pi_sharp_remove > pi_sharp_find_min > pi_remove > less_than > issmallestelement_pq > contains_slb > contains_pq > contains_cpq > pi_removemin > pi_find_min > phi > ok > isnonempty_slb > isnonempty_pq > check_cpq > triple > update_slb > removemin_pq_res > removemin_pq_eff > remove_slb > remove_pqp > remove_pq > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_pq > insert_cpq > findmin_pq_res > findmin_pq_eff > #nlpp > removemin_cpq_res > removemin_cpq_eff > i > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > create_pq > bottom > bad > #skF_2 > #skF_4 > #skF_7 > #skF_5 > #skF_6 > #skF_8 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_find_min,type,
pi_sharp_find_min: ( $i * $i ) > $o ).
tff(pi_remove,type,
pi_remove: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(insert_pq,type,
insert_pq: ( $i * $i ) > $i ).
tff(pi_find_min,type,
pi_find_min: $i > $o ).
tff(i,type,
i: $i > $i ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_removemin,type,
pi_sharp_removemin: ( $i * $i ) > $o ).
tff(pi_sharp_remove,type,
pi_sharp_remove: ( $i * $i ) > $o ).
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(contains_pq,type,
contains_pq: ( $i * $i ) > $o ).
tff(findmin_pq_eff,type,
findmin_pq_eff: ( $i * $i ) > $i ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pi_removemin,type,
pi_removemin: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(phi,type,
phi: $i > $o ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(isnonempty_pq,type,
isnonempty_pq: $i > $o ).
tff(findmin_pq_res,type,
findmin_pq_res: ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(issmallestelement_pq,type,
issmallestelement_pq: ( $i * $i ) > $o ).
tff(contains_cpq,type,
contains_cpq: ( $i * $i ) > $o ).
tff(strictly_less_than,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(ok,type,
ok: $i > $o ).
tff(insert_pqp,type,
insert_pqp: ( $i * $i ) > $i ).
tff(remove_pq,type,
remove_pq: ( $i * $i ) > $i ).
tff(findmin_pqp_res,type,
findmin_pqp_res: $i > $i ).
tff(remove_pqp,type,
remove_pqp: ( $i * $i ) > $i ).
tff(bottom,type,
bottom: $i ).
tff(removemin_pq_res,type,
removemin_pq_res: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(create_pq,type,
create_pq: $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(isnonempty_slb,type,
isnonempty_slb: $i > $o ).
tff(check_cpq,type,
check_cpq: $i > $o ).
tff(remove_slb,type,
remove_slb: ( $i * $i ) > $i ).
tff(findmin_cpq_eff,type,
findmin_cpq_eff: $i > $i ).
tff(removemin_cpq_eff,type,
removemin_cpq_eff: $i > $i ).
tff(create_slb,type,
create_slb: $i ).
tff(removemin_pq_eff,type,
removemin_pq_eff: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(findmin_cpq_res,type,
findmin_cpq_res: $i > $i ).
tff(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_435,lemma,
! [U,V,W,X,Y] : ( i(triple(U,W,X)) = i(triple(V,W,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main3_li12) ).
tff(f_448,negated_conjecture,
~ ! [U,V,W,X] :
( pi_remove(triple(U,V,W),X)
=> ( phi(remove_cpq(triple(U,V,W),X))
=> ( pi_sharp_remove(i(triple(U,V,W)),X)
& ( i(remove_cpq(triple(U,V,W),X)) = remove_pq(i(triple(U,V,W)),X) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co3) ).
tff(f_400,axiom,
! [U,V] :
( pi_remove(U,V)
<=> pi_sharp_remove(i(U),V) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax57) ).
tff(f_396,axiom,
! [U,V] :
( pi_sharp_remove(U,V)
<=> contains_pq(U,V) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax56) ).
tff(f_439,lemma,
! [U,V,W,X] :
( contains_pq(i(triple(U,V,W)),X)
=> ( i(remove_cpq(triple(U,V,W),X)) = remove_pq(i(triple(U,V,W)),X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main3_li34) ).
tff(c_931,plain,
! [X_366,W_368,Y_365,V_364,U_367] : ( i(triple(V_364,W_368,Y_365)) = i(triple(U_367,W_368,X_366)) ),
inference(cnfTransformation,[status(thm)],[f_435]) ).
tff(c_182,plain,
pi_remove(triple('#skF_5','#skF_6','#skF_7'),'#skF_8'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_142,plain,
! [U_154,V_155] :
( pi_sharp_remove(i(U_154),V_155)
| ~ pi_remove(U_154,V_155) ),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_178,plain,
( ( remove_pq(i(triple('#skF_5','#skF_6','#skF_7')),'#skF_8') != i(remove_cpq(triple('#skF_5','#skF_6','#skF_7'),'#skF_8')) )
| ~ pi_sharp_remove(i(triple('#skF_5','#skF_6','#skF_7')),'#skF_8') ),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_255,plain,
~ pi_sharp_remove(i(triple('#skF_5','#skF_6','#skF_7')),'#skF_8'),
inference(splitLeft,[status(thm)],[c_178]) ).
tff(c_298,plain,
~ pi_remove(triple('#skF_5','#skF_6','#skF_7'),'#skF_8'),
inference(resolution,[status(thm)],[c_142,c_255]) ).
tff(c_305,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_182,c_298]) ).
tff(c_307,plain,
pi_sharp_remove(i(triple('#skF_5','#skF_6','#skF_7')),'#skF_8'),
inference(splitRight,[status(thm)],[c_178]) ).
tff(c_1077,plain,
! [V_369,Y_370] : pi_sharp_remove(i(triple(V_369,'#skF_6',Y_370)),'#skF_8'),
inference(superposition,[status(thm),theory(equality)],[c_931,c_307]) ).
tff(c_138,plain,
! [U_152,V_153] :
( contains_pq(U_152,V_153)
| ~ pi_sharp_remove(U_152,V_153) ),
inference(cnfTransformation,[status(thm)],[f_396]) ).
tff(c_1093,plain,
! [V_369,Y_370] : contains_pq(i(triple(V_369,'#skF_6',Y_370)),'#skF_8'),
inference(resolution,[status(thm)],[c_1077,c_138]) ).
tff(c_5157,plain,
! [U_790,V_791,W_792,X_793] :
( ( remove_pq(i(triple(U_790,V_791,W_792)),X_793) = i(remove_cpq(triple(U_790,V_791,W_792),X_793)) )
| ~ contains_pq(i(triple(U_790,V_791,W_792)),X_793) ),
inference(cnfTransformation,[status(thm)],[f_439]) ).
tff(c_5197,plain,
! [V_369,Y_370] : ( remove_pq(i(triple(V_369,'#skF_6',Y_370)),'#skF_8') = i(remove_cpq(triple(V_369,'#skF_6',Y_370),'#skF_8')) ),
inference(resolution,[status(thm)],[c_1093,c_5157]) ).
tff(c_306,plain,
remove_pq(i(triple('#skF_5','#skF_6','#skF_7')),'#skF_8') != i(remove_cpq(triple('#skF_5','#skF_6','#skF_7'),'#skF_8')),
inference(splitRight,[status(thm)],[c_178]) ).
tff(c_1027,plain,
! [U_367,X_366] : ( remove_pq(i(triple(U_367,'#skF_6',X_366)),'#skF_8') != i(remove_cpq(triple('#skF_5','#skF_6','#skF_7'),'#skF_8')) ),
inference(superposition,[status(thm),theory(equality)],[c_931,c_306]) ).
tff(c_5236,plain,
! [U_367,X_366] : ( i(remove_cpq(triple(U_367,'#skF_6',X_366),'#skF_8')) != i(remove_cpq(triple('#skF_5','#skF_6','#skF_7'),'#skF_8')) ),
inference(demodulation,[status(thm),theory(equality)],[c_5197,c_1027]) ).
tff(c_5515,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_5236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV416+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.16/0.36 % Computer : n011.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 22:30:36 EDT 2023
% 0.16/0.36 % CPUTime :
% 8.94/3.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.94/3.10
% 8.94/3.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.94/3.12
% 8.94/3.12 Inference rules
% 8.94/3.12 ----------------------
% 8.94/3.12 #Ref : 1
% 8.94/3.12 #Sup : 1265
% 8.94/3.12 #Fact : 28
% 8.94/3.12 #Define : 0
% 8.94/3.12 #Split : 4
% 8.94/3.12 #Chain : 0
% 8.94/3.12 #Close : 0
% 8.94/3.12
% 8.94/3.12 Ordering : KBO
% 8.94/3.12
% 8.94/3.12 Simplification rules
% 8.94/3.12 ----------------------
% 8.94/3.12 #Subsume : 309
% 8.94/3.12 #Demod : 249
% 8.94/3.12 #Tautology : 368
% 8.94/3.12 #SimpNegUnit : 31
% 8.94/3.12 #BackRed : 2
% 8.94/3.12
% 8.94/3.12 #Partial instantiations: 0
% 8.94/3.12 #Strategies tried : 1
% 8.94/3.12
% 8.94/3.12 Timing (in seconds)
% 8.94/3.12 ----------------------
% 8.94/3.12 Preprocessing : 0.71
% 8.94/3.13 Parsing : 0.36
% 8.94/3.13 CNF conversion : 0.05
% 8.94/3.13 Main loop : 1.33
% 8.94/3.13 Inferencing : 0.47
% 8.94/3.13 Reduction : 0.42
% 8.94/3.13 Demodulation : 0.31
% 8.94/3.13 BG Simplification : 0.06
% 8.94/3.13 Subsumption : 0.29
% 8.94/3.13 Abstraction : 0.04
% 8.94/3.13 MUC search : 0.00
% 8.94/3.13 Cooper : 0.00
% 8.94/3.13 Total : 2.09
% 8.94/3.13 Index Insertion : 0.00
% 8.94/3.13 Index Deletion : 0.00
% 8.94/3.13 Index Matching : 0.00
% 8.94/3.13 BG Taut test : 0.00
%------------------------------------------------------------------------------